/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:05:19,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:05:19,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:05:19,924 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:05:19,924 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:05:19,925 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:05:19,927 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:05:19,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:05:19,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:05:19,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:05:19,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:05:19,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:05:19,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:05:19,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:05:19,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:05:19,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:05:19,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:05:19,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:05:19,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:05:19,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:05:19,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:05:19,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:05:19,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:05:19,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:05:19,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:05:19,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:05:19,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:05:19,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:05:19,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:05:19,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:05:19,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:05:19,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:05:19,980 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:05:19,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:05:19,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:05:19,982 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:05:19,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:05:19,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:05:19,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:05:19,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:05:19,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:05:19,986 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:05:20,013 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:05:20,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:05:20,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:05:20,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:05:20,015 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:05:20,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:05:20,016 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:05:20,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:05:20,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:05:20,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:05:20,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:05:20,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:05:20,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:05:20,017 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:05:20,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:05:20,017 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:05:20,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:05:20,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:05:20,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:05:20,018 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:05:20,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:05:20,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:05:20,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:05:20,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:05:20,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:05:20,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:05:20,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:05:20,020 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:05:20,020 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:05:20,020 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:05:20,317 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:05:20,332 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:05:20,335 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:05:20,337 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:05:20,337 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:05:20,338 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_pso.oepc.i [2019-12-18 13:05:20,414 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0ddc646/277922cd844340b18c4e4865f4c4d509/FLAGa7372b19c [2019-12-18 13:05:20,999 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:05:21,000 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_pso.oepc.i [2019-12-18 13:05:21,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0ddc646/277922cd844340b18c4e4865f4c4d509/FLAGa7372b19c [2019-12-18 13:05:21,253 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0ddc646/277922cd844340b18c4e4865f4c4d509 [2019-12-18 13:05:21,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:05:21,268 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:05:21,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:05:21,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:05:21,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:05:21,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:05:21" (1/1) ... [2019-12-18 13:05:21,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5677aabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:05:21, skipping insertion in model container [2019-12-18 13:05:21,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:05:21" (1/1) ... [2019-12-18 13:05:21,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:05:21,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:05:21,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:05:21,865 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:05:21,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:05:22,052 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:05:22,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:05:22 WrapperNode [2019-12-18 13:05:22,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:05:22,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:05:22,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:05:22,053 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:05:22,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:05:22" (1/1) ... [2019-12-18 13:05:22,084 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:05:22" (1/1) ... [2019-12-18 13:05:22,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:05:22,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:05:22,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:05:22,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:05:22,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:05:22" (1/1) ... [2019-12-18 13:05:22,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:05:22" (1/1) ... [2019-12-18 13:05:22,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:05:22" (1/1) ... [2019-12-18 13:05:22,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:05:22" (1/1) ... [2019-12-18 13:05:22,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:05:22" (1/1) ... [2019-12-18 13:05:22,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:05:22" (1/1) ... [2019-12-18 13:05:22,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:05:22" (1/1) ... [2019-12-18 13:05:22,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:05:22,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:05:22,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:05:22,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:05:22,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:05:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:05:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:05:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:05:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:05:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:05:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:05:22,228 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:05:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:05:22,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:05:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:05:22,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:05:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:05:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:05:22,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:05:22,231 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:05:22,939 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:05:22,939 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:05:22,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:05:22 BoogieIcfgContainer [2019-12-18 13:05:22,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:05:22,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:05:22,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:05:22,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:05:22,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:05:21" (1/3) ... [2019-12-18 13:05:22,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e45f8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:05:22, skipping insertion in model container [2019-12-18 13:05:22,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:05:22" (2/3) ... [2019-12-18 13:05:22,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e45f8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:05:22, skipping insertion in model container [2019-12-18 13:05:22,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:05:22" (3/3) ... [2019-12-18 13:05:22,954 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_pso.oepc.i [2019-12-18 13:05:22,965 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:05:22,966 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:05:22,975 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:05:22,977 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:05:23,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,032 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,032 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,032 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,033 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,033 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,042 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,042 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,068 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,068 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,097 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,097 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,097 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,100 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,101 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,105 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,107 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:05:23,125 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:05:23,146 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:05:23,146 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:05:23,147 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:05:23,147 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:05:23,147 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:05:23,147 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:05:23,147 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:05:23,147 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:05:23,165 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 13:05:23,167 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 13:05:23,257 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 13:05:23,257 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:05:23,276 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:05:23,305 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 13:05:23,358 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 13:05:23,358 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:05:23,367 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:05:23,390 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:05:23,391 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:05:29,306 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 13:05:29,425 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 13:05:29,456 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87070 [2019-12-18 13:05:29,456 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 13:05:29,460 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-18 13:05:47,944 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-18 13:05:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-18 13:05:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:05:47,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:47,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:05:47,954 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:47,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:47,959 INFO L82 PathProgramCache]: Analyzing trace with hash 911890, now seen corresponding path program 1 times [2019-12-18 13:05:47,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:47,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961408651] [2019-12-18 13:05:47,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:05:48,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961408651] [2019-12-18 13:05:48,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:48,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:05:48,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489221248] [2019-12-18 13:05:48,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:05:48,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:48,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:05:48,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:48,190 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-18 13:05:49,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:49,505 INFO L93 Difference]: Finished difference Result 114158 states and 484836 transitions. [2019-12-18 13:05:49,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:05:49,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:05:49,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:53,218 INFO L225 Difference]: With dead ends: 114158 [2019-12-18 13:05:53,218 INFO L226 Difference]: Without dead ends: 107060 [2019-12-18 13:05:53,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:58,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107060 states. [2019-12-18 13:06:00,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107060 to 107060. [2019-12-18 13:06:00,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107060 states. [2019-12-18 13:06:04,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107060 states to 107060 states and 454078 transitions. [2019-12-18 13:06:04,631 INFO L78 Accepts]: Start accepts. Automaton has 107060 states and 454078 transitions. Word has length 3 [2019-12-18 13:06:04,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:04,631 INFO L462 AbstractCegarLoop]: Abstraction has 107060 states and 454078 transitions. [2019-12-18 13:06:04,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:06:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 107060 states and 454078 transitions. [2019-12-18 13:06:04,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:06:04,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:04,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:04,637 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:04,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:04,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1487504284, now seen corresponding path program 1 times [2019-12-18 13:06:04,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:04,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73823715] [2019-12-18 13:06:04,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:04,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73823715] [2019-12-18 13:06:04,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:04,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:06:04,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521209928] [2019-12-18 13:06:04,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:06:04,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:04,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:06:04,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:06:04,786 INFO L87 Difference]: Start difference. First operand 107060 states and 454078 transitions. Second operand 4 states. [2019-12-18 13:06:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:10,120 INFO L93 Difference]: Finished difference Result 166396 states and 678148 transitions. [2019-12-18 13:06:10,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:06:10,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:06:10,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:10,748 INFO L225 Difference]: With dead ends: 166396 [2019-12-18 13:06:10,749 INFO L226 Difference]: Without dead ends: 166347 [2019-12-18 13:06:10,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:06:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166347 states. [2019-12-18 13:06:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166347 to 151934. [2019-12-18 13:06:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151934 states. [2019-12-18 13:06:27,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151934 states to 151934 states and 627001 transitions. [2019-12-18 13:06:27,314 INFO L78 Accepts]: Start accepts. Automaton has 151934 states and 627001 transitions. Word has length 11 [2019-12-18 13:06:27,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:27,315 INFO L462 AbstractCegarLoop]: Abstraction has 151934 states and 627001 transitions. [2019-12-18 13:06:27,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:06:27,315 INFO L276 IsEmpty]: Start isEmpty. Operand 151934 states and 627001 transitions. [2019-12-18 13:06:27,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:06:27,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:27,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:27,321 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:27,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:27,322 INFO L82 PathProgramCache]: Analyzing trace with hash 881606285, now seen corresponding path program 1 times [2019-12-18 13:06:27,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:27,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062390758] [2019-12-18 13:06:27,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:27,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:27,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062390758] [2019-12-18 13:06:27,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:27,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:06:27,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353373377] [2019-12-18 13:06:27,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:06:27,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:27,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:06:27,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:06:27,408 INFO L87 Difference]: Start difference. First operand 151934 states and 627001 transitions. Second operand 3 states. [2019-12-18 13:06:27,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:27,535 INFO L93 Difference]: Finished difference Result 33114 states and 107084 transitions. [2019-12-18 13:06:27,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:06:27,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:06:27,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:27,601 INFO L225 Difference]: With dead ends: 33114 [2019-12-18 13:06:27,602 INFO L226 Difference]: Without dead ends: 33114 [2019-12-18 13:06:27,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:06:27,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33114 states. [2019-12-18 13:06:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33114 to 33114. [2019-12-18 13:06:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33114 states. [2019-12-18 13:06:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33114 states to 33114 states and 107084 transitions. [2019-12-18 13:06:28,403 INFO L78 Accepts]: Start accepts. Automaton has 33114 states and 107084 transitions. Word has length 13 [2019-12-18 13:06:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:28,403 INFO L462 AbstractCegarLoop]: Abstraction has 33114 states and 107084 transitions. [2019-12-18 13:06:28,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:06:28,404 INFO L276 IsEmpty]: Start isEmpty. Operand 33114 states and 107084 transitions. [2019-12-18 13:06:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:06:28,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:28,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:28,407 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:28,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:28,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1702625862, now seen corresponding path program 1 times [2019-12-18 13:06:28,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:28,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999353942] [2019-12-18 13:06:28,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:28,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:28,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999353942] [2019-12-18 13:06:28,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:28,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:06:28,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588906958] [2019-12-18 13:06:28,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:06:28,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:28,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:06:28,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:06:28,556 INFO L87 Difference]: Start difference. First operand 33114 states and 107084 transitions. Second operand 4 states. [2019-12-18 13:06:28,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:28,933 INFO L93 Difference]: Finished difference Result 41561 states and 133908 transitions. [2019-12-18 13:06:28,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:06:28,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:06:28,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:28,999 INFO L225 Difference]: With dead ends: 41561 [2019-12-18 13:06:28,999 INFO L226 Difference]: Without dead ends: 41561 [2019-12-18 13:06:28,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:06:30,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41561 states. [2019-12-18 13:06:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41561 to 37204. [2019-12-18 13:06:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37204 states. [2019-12-18 13:06:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37204 states to 37204 states and 120245 transitions. [2019-12-18 13:06:30,658 INFO L78 Accepts]: Start accepts. Automaton has 37204 states and 120245 transitions. Word has length 16 [2019-12-18 13:06:30,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:30,662 INFO L462 AbstractCegarLoop]: Abstraction has 37204 states and 120245 transitions. [2019-12-18 13:06:30,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:06:30,662 INFO L276 IsEmpty]: Start isEmpty. Operand 37204 states and 120245 transitions. [2019-12-18 13:06:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:06:30,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:30,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:30,672 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:30,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:30,672 INFO L82 PathProgramCache]: Analyzing trace with hash -989401703, now seen corresponding path program 1 times [2019-12-18 13:06:30,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:30,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748140419] [2019-12-18 13:06:30,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:30,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748140419] [2019-12-18 13:06:30,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:30,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:06:30,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801103374] [2019-12-18 13:06:30,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:06:30,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:30,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:06:30,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:06:30,851 INFO L87 Difference]: Start difference. First operand 37204 states and 120245 transitions. Second operand 5 states. [2019-12-18 13:06:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:31,564 INFO L93 Difference]: Finished difference Result 47941 states and 152440 transitions. [2019-12-18 13:06:31,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:06:31,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:06:31,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:31,648 INFO L225 Difference]: With dead ends: 47941 [2019-12-18 13:06:31,648 INFO L226 Difference]: Without dead ends: 47934 [2019-12-18 13:06:31,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:06:32,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47934 states. [2019-12-18 13:06:32,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47934 to 36849. [2019-12-18 13:06:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36849 states. [2019-12-18 13:06:32,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36849 states to 36849 states and 118974 transitions. [2019-12-18 13:06:32,869 INFO L78 Accepts]: Start accepts. Automaton has 36849 states and 118974 transitions. Word has length 22 [2019-12-18 13:06:32,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:32,870 INFO L462 AbstractCegarLoop]: Abstraction has 36849 states and 118974 transitions. [2019-12-18 13:06:32,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:06:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 36849 states and 118974 transitions. [2019-12-18 13:06:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:06:32,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:32,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:32,884 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:32,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:32,884 INFO L82 PathProgramCache]: Analyzing trace with hash -2090054503, now seen corresponding path program 1 times [2019-12-18 13:06:32,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:32,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560019384] [2019-12-18 13:06:32,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:32,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560019384] [2019-12-18 13:06:32,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:32,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:06:32,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987629176] [2019-12-18 13:06:32,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:06:32,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:32,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:06:32,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:06:32,944 INFO L87 Difference]: Start difference. First operand 36849 states and 118974 transitions. Second operand 4 states. [2019-12-18 13:06:33,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:33,013 INFO L93 Difference]: Finished difference Result 15264 states and 46609 transitions. [2019-12-18 13:06:33,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:06:33,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:06:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:33,037 INFO L225 Difference]: With dead ends: 15264 [2019-12-18 13:06:33,037 INFO L226 Difference]: Without dead ends: 15264 [2019-12-18 13:06:33,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:06:33,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15264 states. [2019-12-18 13:06:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15264 to 14936. [2019-12-18 13:06:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14936 states. [2019-12-18 13:06:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14936 states to 14936 states and 45673 transitions. [2019-12-18 13:06:33,276 INFO L78 Accepts]: Start accepts. Automaton has 14936 states and 45673 transitions. Word has length 25 [2019-12-18 13:06:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:33,276 INFO L462 AbstractCegarLoop]: Abstraction has 14936 states and 45673 transitions. [2019-12-18 13:06:33,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:06:33,277 INFO L276 IsEmpty]: Start isEmpty. Operand 14936 states and 45673 transitions. [2019-12-18 13:06:33,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:06:33,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:33,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:33,290 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:33,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:33,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1906532401, now seen corresponding path program 1 times [2019-12-18 13:06:33,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:33,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247909225] [2019-12-18 13:06:33,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:33,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:33,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247909225] [2019-12-18 13:06:33,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:33,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:06:33,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913997272] [2019-12-18 13:06:33,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:06:33,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:33,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:06:33,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:06:33,345 INFO L87 Difference]: Start difference. First operand 14936 states and 45673 transitions. Second operand 3 states. [2019-12-18 13:06:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:33,457 INFO L93 Difference]: Finished difference Result 21267 states and 63997 transitions. [2019-12-18 13:06:33,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:06:33,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:06:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:33,485 INFO L225 Difference]: With dead ends: 21267 [2019-12-18 13:06:33,486 INFO L226 Difference]: Without dead ends: 21267 [2019-12-18 13:06:33,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:06:33,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21267 states. [2019-12-18 13:06:34,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21267 to 15790. [2019-12-18 13:06:34,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15790 states. [2019-12-18 13:06:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15790 states to 15790 states and 48131 transitions. [2019-12-18 13:06:34,117 INFO L78 Accepts]: Start accepts. Automaton has 15790 states and 48131 transitions. Word has length 27 [2019-12-18 13:06:34,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:34,118 INFO L462 AbstractCegarLoop]: Abstraction has 15790 states and 48131 transitions. [2019-12-18 13:06:34,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:06:34,118 INFO L276 IsEmpty]: Start isEmpty. Operand 15790 states and 48131 transitions. [2019-12-18 13:06:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:06:34,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:34,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:34,130 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:34,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:34,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1466938041, now seen corresponding path program 1 times [2019-12-18 13:06:34,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:34,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505472694] [2019-12-18 13:06:34,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:34,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505472694] [2019-12-18 13:06:34,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:34,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:06:34,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668689629] [2019-12-18 13:06:34,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:06:34,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:34,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:06:34,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:06:34,257 INFO L87 Difference]: Start difference. First operand 15790 states and 48131 transitions. Second operand 6 states. [2019-12-18 13:06:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:35,030 INFO L93 Difference]: Finished difference Result 40724 states and 122204 transitions. [2019-12-18 13:06:35,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:06:35,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:06:35,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:35,093 INFO L225 Difference]: With dead ends: 40724 [2019-12-18 13:06:35,093 INFO L226 Difference]: Without dead ends: 40724 [2019-12-18 13:06:35,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:06:35,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40724 states. [2019-12-18 13:06:35,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40724 to 22567. [2019-12-18 13:06:35,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22567 states. [2019-12-18 13:06:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22567 states to 22567 states and 69647 transitions. [2019-12-18 13:06:35,596 INFO L78 Accepts]: Start accepts. Automaton has 22567 states and 69647 transitions. Word has length 27 [2019-12-18 13:06:35,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:35,596 INFO L462 AbstractCegarLoop]: Abstraction has 22567 states and 69647 transitions. [2019-12-18 13:06:35,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:06:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 22567 states and 69647 transitions. [2019-12-18 13:06:35,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:06:35,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:35,616 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:35,616 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:35,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:35,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1177717026, now seen corresponding path program 1 times [2019-12-18 13:06:35,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:35,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258355794] [2019-12-18 13:06:35,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:35,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258355794] [2019-12-18 13:06:35,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:35,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:06:35,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238874242] [2019-12-18 13:06:35,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:06:35,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:35,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:06:35,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:06:35,727 INFO L87 Difference]: Start difference. First operand 22567 states and 69647 transitions. Second operand 6 states. [2019-12-18 13:06:36,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:36,569 INFO L93 Difference]: Finished difference Result 37765 states and 113362 transitions. [2019-12-18 13:06:36,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:06:36,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 13:06:36,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:36,626 INFO L225 Difference]: With dead ends: 37765 [2019-12-18 13:06:36,626 INFO L226 Difference]: Without dead ends: 37765 [2019-12-18 13:06:36,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:06:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37765 states. [2019-12-18 13:06:37,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37765 to 22218. [2019-12-18 13:06:37,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22218 states. [2019-12-18 13:06:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22218 states to 22218 states and 68697 transitions. [2019-12-18 13:06:37,490 INFO L78 Accepts]: Start accepts. Automaton has 22218 states and 68697 transitions. Word has length 28 [2019-12-18 13:06:37,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:37,490 INFO L462 AbstractCegarLoop]: Abstraction has 22218 states and 68697 transitions. [2019-12-18 13:06:37,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:06:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 22218 states and 68697 transitions. [2019-12-18 13:06:37,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:06:37,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:37,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:37,517 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:37,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:37,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1088633804, now seen corresponding path program 1 times [2019-12-18 13:06:37,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:37,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771167445] [2019-12-18 13:06:37,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:37,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771167445] [2019-12-18 13:06:37,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:37,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:06:37,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117120159] [2019-12-18 13:06:37,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:06:37,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:37,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:06:37,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:06:37,645 INFO L87 Difference]: Start difference. First operand 22218 states and 68697 transitions. Second operand 7 states. [2019-12-18 13:06:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:39,207 INFO L93 Difference]: Finished difference Result 50401 states and 150592 transitions. [2019-12-18 13:06:39,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 13:06:39,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:06:39,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:39,289 INFO L225 Difference]: With dead ends: 50401 [2019-12-18 13:06:39,289 INFO L226 Difference]: Without dead ends: 50401 [2019-12-18 13:06:39,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:06:39,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50401 states. [2019-12-18 13:06:40,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50401 to 23449. [2019-12-18 13:06:40,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23449 states. [2019-12-18 13:06:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23449 states to 23449 states and 72523 transitions. [2019-12-18 13:06:40,355 INFO L78 Accepts]: Start accepts. Automaton has 23449 states and 72523 transitions. Word has length 33 [2019-12-18 13:06:40,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:40,355 INFO L462 AbstractCegarLoop]: Abstraction has 23449 states and 72523 transitions. [2019-12-18 13:06:40,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:06:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 23449 states and 72523 transitions. [2019-12-18 13:06:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:06:40,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:40,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:40,380 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:40,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:40,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1082826604, now seen corresponding path program 1 times [2019-12-18 13:06:40,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:40,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753879580] [2019-12-18 13:06:40,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:40,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753879580] [2019-12-18 13:06:40,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:40,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:06:40,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497118871] [2019-12-18 13:06:40,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:06:40,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:40,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:06:40,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:06:40,417 INFO L87 Difference]: Start difference. First operand 23449 states and 72523 transitions. Second operand 3 states. [2019-12-18 13:06:40,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:40,557 INFO L93 Difference]: Finished difference Result 31046 states and 92713 transitions. [2019-12-18 13:06:40,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:06:40,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 13:06:40,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:40,601 INFO L225 Difference]: With dead ends: 31046 [2019-12-18 13:06:40,601 INFO L226 Difference]: Without dead ends: 31046 [2019-12-18 13:06:40,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:06:40,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31046 states. [2019-12-18 13:06:40,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31046 to 22288. [2019-12-18 13:06:40,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22288 states. [2019-12-18 13:06:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22288 states to 22288 states and 66690 transitions. [2019-12-18 13:06:40,994 INFO L78 Accepts]: Start accepts. Automaton has 22288 states and 66690 transitions. Word has length 33 [2019-12-18 13:06:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:40,994 INFO L462 AbstractCegarLoop]: Abstraction has 22288 states and 66690 transitions. [2019-12-18 13:06:40,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:06:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 22288 states and 66690 transitions. [2019-12-18 13:06:41,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:06:41,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:41,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:41,013 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:41,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:41,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1090977820, now seen corresponding path program 2 times [2019-12-18 13:06:41,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:41,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237062366] [2019-12-18 13:06:41,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:41,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237062366] [2019-12-18 13:06:41,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:41,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:06:41,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685108154] [2019-12-18 13:06:41,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:06:41,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:41,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:06:41,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:06:41,170 INFO L87 Difference]: Start difference. First operand 22288 states and 66690 transitions. Second operand 8 states. [2019-12-18 13:06:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:42,950 INFO L93 Difference]: Finished difference Result 49099 states and 143360 transitions. [2019-12-18 13:06:42,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:06:42,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 13:06:42,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:43,022 INFO L225 Difference]: With dead ends: 49099 [2019-12-18 13:06:43,022 INFO L226 Difference]: Without dead ends: 49099 [2019-12-18 13:06:43,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:06:43,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49099 states. [2019-12-18 13:06:43,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49099 to 21685. [2019-12-18 13:06:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21685 states. [2019-12-18 13:06:43,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21685 states to 21685 states and 64891 transitions. [2019-12-18 13:06:43,996 INFO L78 Accepts]: Start accepts. Automaton has 21685 states and 64891 transitions. Word has length 33 [2019-12-18 13:06:43,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:43,996 INFO L462 AbstractCegarLoop]: Abstraction has 21685 states and 64891 transitions. [2019-12-18 13:06:43,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:06:43,996 INFO L276 IsEmpty]: Start isEmpty. Operand 21685 states and 64891 transitions. [2019-12-18 13:06:44,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:06:44,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:44,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:44,018 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:44,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:44,018 INFO L82 PathProgramCache]: Analyzing trace with hash 791261483, now seen corresponding path program 1 times [2019-12-18 13:06:44,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:44,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141199245] [2019-12-18 13:06:44,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:44,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141199245] [2019-12-18 13:06:44,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:44,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:06:44,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713070322] [2019-12-18 13:06:44,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:06:44,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:44,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:06:44,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:06:44,117 INFO L87 Difference]: Start difference. First operand 21685 states and 64891 transitions. Second operand 5 states. [2019-12-18 13:06:44,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:44,266 INFO L93 Difference]: Finished difference Result 22029 states and 65668 transitions. [2019-12-18 13:06:44,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:06:44,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-18 13:06:44,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:44,311 INFO L225 Difference]: With dead ends: 22029 [2019-12-18 13:06:44,312 INFO L226 Difference]: Without dead ends: 22029 [2019-12-18 13:06:44,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:06:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22029 states. [2019-12-18 13:06:44,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22029 to 22029. [2019-12-18 13:06:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22029 states. [2019-12-18 13:06:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22029 states to 22029 states and 65668 transitions. [2019-12-18 13:06:44,688 INFO L78 Accepts]: Start accepts. Automaton has 22029 states and 65668 transitions. Word has length 34 [2019-12-18 13:06:44,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:44,688 INFO L462 AbstractCegarLoop]: Abstraction has 22029 states and 65668 transitions. [2019-12-18 13:06:44,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:06:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 22029 states and 65668 transitions. [2019-12-18 13:06:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 13:06:44,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:44,717 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:44,717 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:44,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:44,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1352546088, now seen corresponding path program 1 times [2019-12-18 13:06:44,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:44,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567772873] [2019-12-18 13:06:44,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:44,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567772873] [2019-12-18 13:06:44,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:44,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:06:44,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622139329] [2019-12-18 13:06:44,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:06:44,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:44,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:06:44,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:06:44,829 INFO L87 Difference]: Start difference. First operand 22029 states and 65668 transitions. Second operand 7 states. [2019-12-18 13:06:46,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:46,157 INFO L93 Difference]: Finished difference Result 37994 states and 110936 transitions. [2019-12-18 13:06:46,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:06:46,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-18 13:06:46,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:46,210 INFO L225 Difference]: With dead ends: 37994 [2019-12-18 13:06:46,210 INFO L226 Difference]: Without dead ends: 37994 [2019-12-18 13:06:46,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:06:46,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37994 states. [2019-12-18 13:06:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37994 to 20751. [2019-12-18 13:06:47,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20751 states. [2019-12-18 13:06:47,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20751 states to 20751 states and 62011 transitions. [2019-12-18 13:06:47,073 INFO L78 Accepts]: Start accepts. Automaton has 20751 states and 62011 transitions. Word has length 35 [2019-12-18 13:06:47,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:47,073 INFO L462 AbstractCegarLoop]: Abstraction has 20751 states and 62011 transitions. [2019-12-18 13:06:47,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:06:47,073 INFO L276 IsEmpty]: Start isEmpty. Operand 20751 states and 62011 transitions. [2019-12-18 13:06:47,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 13:06:47,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:47,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:47,095 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:47,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:47,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1641645214, now seen corresponding path program 2 times [2019-12-18 13:06:47,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:47,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963168988] [2019-12-18 13:06:47,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:47,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963168988] [2019-12-18 13:06:47,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:47,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:06:47,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838281200] [2019-12-18 13:06:47,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:06:47,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:47,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:06:47,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:06:47,276 INFO L87 Difference]: Start difference. First operand 20751 states and 62011 transitions. Second operand 8 states. [2019-12-18 13:06:49,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:49,020 INFO L93 Difference]: Finished difference Result 47976 states and 138707 transitions. [2019-12-18 13:06:49,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 13:06:49,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-18 13:06:49,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:49,131 INFO L225 Difference]: With dead ends: 47976 [2019-12-18 13:06:49,131 INFO L226 Difference]: Without dead ends: 47976 [2019-12-18 13:06:49,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:06:49,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47976 states. [2019-12-18 13:06:49,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47976 to 20164. [2019-12-18 13:06:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20164 states. [2019-12-18 13:06:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20164 states to 20164 states and 60276 transitions. [2019-12-18 13:06:49,680 INFO L78 Accepts]: Start accepts. Automaton has 20164 states and 60276 transitions. Word has length 35 [2019-12-18 13:06:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:49,681 INFO L462 AbstractCegarLoop]: Abstraction has 20164 states and 60276 transitions. [2019-12-18 13:06:49,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:06:49,681 INFO L276 IsEmpty]: Start isEmpty. Operand 20164 states and 60276 transitions. [2019-12-18 13:06:49,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 13:06:49,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:49,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:49,698 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:49,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:49,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1975616128, now seen corresponding path program 3 times [2019-12-18 13:06:49,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:49,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087241819] [2019-12-18 13:06:49,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:49,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:49,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087241819] [2019-12-18 13:06:49,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:49,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:06:49,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941328272] [2019-12-18 13:06:49,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:06:49,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:49,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:06:49,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:06:49,904 INFO L87 Difference]: Start difference. First operand 20164 states and 60276 transitions. Second operand 9 states. [2019-12-18 13:06:51,767 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-12-18 13:06:52,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:52,289 INFO L93 Difference]: Finished difference Result 41366 states and 120395 transitions. [2019-12-18 13:06:52,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 13:06:52,290 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-18 13:06:52,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:52,345 INFO L225 Difference]: With dead ends: 41366 [2019-12-18 13:06:52,346 INFO L226 Difference]: Without dead ends: 41366 [2019-12-18 13:06:52,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-12-18 13:06:52,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41366 states. [2019-12-18 13:06:52,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41366 to 19840. [2019-12-18 13:06:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19840 states. [2019-12-18 13:06:52,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19840 states to 19840 states and 59352 transitions. [2019-12-18 13:06:52,794 INFO L78 Accepts]: Start accepts. Automaton has 19840 states and 59352 transitions. Word has length 35 [2019-12-18 13:06:52,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:52,794 INFO L462 AbstractCegarLoop]: Abstraction has 19840 states and 59352 transitions. [2019-12-18 13:06:52,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:06:52,795 INFO L276 IsEmpty]: Start isEmpty. Operand 19840 states and 59352 transitions. [2019-12-18 13:06:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:06:52,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:52,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:52,813 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:52,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:52,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1420266152, now seen corresponding path program 1 times [2019-12-18 13:06:52,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:52,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659970230] [2019-12-18 13:06:52,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:52,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:52,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659970230] [2019-12-18 13:06:52,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:52,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:06:52,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981240244] [2019-12-18 13:06:52,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:06:52,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:52,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:06:52,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:06:52,864 INFO L87 Difference]: Start difference. First operand 19840 states and 59352 transitions. Second operand 3 states. [2019-12-18 13:06:52,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:52,956 INFO L93 Difference]: Finished difference Result 19839 states and 59350 transitions. [2019-12-18 13:06:52,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:06:52,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 13:06:52,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:52,991 INFO L225 Difference]: With dead ends: 19839 [2019-12-18 13:06:52,991 INFO L226 Difference]: Without dead ends: 19839 [2019-12-18 13:06:52,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:06:53,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19839 states. [2019-12-18 13:06:53,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19839 to 19839. [2019-12-18 13:06:53,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19839 states. [2019-12-18 13:06:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19839 states to 19839 states and 59350 transitions. [2019-12-18 13:06:53,480 INFO L78 Accepts]: Start accepts. Automaton has 19839 states and 59350 transitions. Word has length 39 [2019-12-18 13:06:53,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:53,481 INFO L462 AbstractCegarLoop]: Abstraction has 19839 states and 59350 transitions. [2019-12-18 13:06:53,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:06:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand 19839 states and 59350 transitions. [2019-12-18 13:06:53,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:06:53,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:53,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:53,509 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:53,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:53,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1015126435, now seen corresponding path program 1 times [2019-12-18 13:06:53,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:53,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729046715] [2019-12-18 13:06:53,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:53,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729046715] [2019-12-18 13:06:53,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:53,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:06:53,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815203928] [2019-12-18 13:06:53,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:06:53,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:53,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:06:53,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:06:53,557 INFO L87 Difference]: Start difference. First operand 19839 states and 59350 transitions. Second operand 3 states. [2019-12-18 13:06:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:53,717 INFO L93 Difference]: Finished difference Result 37646 states and 112659 transitions. [2019-12-18 13:06:53,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:06:53,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 13:06:53,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:53,756 INFO L225 Difference]: With dead ends: 37646 [2019-12-18 13:06:53,756 INFO L226 Difference]: Without dead ends: 20268 [2019-12-18 13:06:53,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:06:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20268 states. [2019-12-18 13:06:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20268 to 20202. [2019-12-18 13:06:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20202 states. [2019-12-18 13:06:54,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20202 states to 20202 states and 59077 transitions. [2019-12-18 13:06:54,123 INFO L78 Accepts]: Start accepts. Automaton has 20202 states and 59077 transitions. Word has length 40 [2019-12-18 13:06:54,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:54,124 INFO L462 AbstractCegarLoop]: Abstraction has 20202 states and 59077 transitions. [2019-12-18 13:06:54,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:06:54,124 INFO L276 IsEmpty]: Start isEmpty. Operand 20202 states and 59077 transitions. [2019-12-18 13:06:54,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:06:54,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:54,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:54,144 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:54,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:54,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1234885869, now seen corresponding path program 2 times [2019-12-18 13:06:54,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:54,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499129705] [2019-12-18 13:06:54,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:54,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:54,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499129705] [2019-12-18 13:06:54,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:54,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:06:54,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409418440] [2019-12-18 13:06:54,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:06:54,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:54,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:06:54,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:06:54,212 INFO L87 Difference]: Start difference. First operand 20202 states and 59077 transitions. Second operand 5 states. [2019-12-18 13:06:55,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:55,154 INFO L93 Difference]: Finished difference Result 28761 states and 83307 transitions. [2019-12-18 13:06:55,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:06:55,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:06:55,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:55,194 INFO L225 Difference]: With dead ends: 28761 [2019-12-18 13:06:55,194 INFO L226 Difference]: Without dead ends: 28761 [2019-12-18 13:06:55,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:06:55,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28761 states. [2019-12-18 13:06:55,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28761 to 26308. [2019-12-18 13:06:55,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26308 states. [2019-12-18 13:06:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26308 states to 26308 states and 76766 transitions. [2019-12-18 13:06:55,602 INFO L78 Accepts]: Start accepts. Automaton has 26308 states and 76766 transitions. Word has length 40 [2019-12-18 13:06:55,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:55,602 INFO L462 AbstractCegarLoop]: Abstraction has 26308 states and 76766 transitions. [2019-12-18 13:06:55,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:06:55,602 INFO L276 IsEmpty]: Start isEmpty. Operand 26308 states and 76766 transitions. [2019-12-18 13:06:55,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:06:55,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:55,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:55,627 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:55,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:55,627 INFO L82 PathProgramCache]: Analyzing trace with hash 342200019, now seen corresponding path program 3 times [2019-12-18 13:06:55,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:55,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134851350] [2019-12-18 13:06:55,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:55,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134851350] [2019-12-18 13:06:55,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:55,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:06:55,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891516321] [2019-12-18 13:06:55,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:06:55,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:55,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:06:55,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:06:55,694 INFO L87 Difference]: Start difference. First operand 26308 states and 76766 transitions. Second operand 3 states. [2019-12-18 13:06:55,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:55,805 INFO L93 Difference]: Finished difference Result 26308 states and 76686 transitions. [2019-12-18 13:06:55,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:06:55,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 13:06:55,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:55,859 INFO L225 Difference]: With dead ends: 26308 [2019-12-18 13:06:55,859 INFO L226 Difference]: Without dead ends: 26308 [2019-12-18 13:06:55,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:06:56,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26308 states. [2019-12-18 13:06:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26308 to 21749. [2019-12-18 13:06:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21749 states. [2019-12-18 13:06:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21749 states to 21749 states and 64098 transitions. [2019-12-18 13:06:56,314 INFO L78 Accepts]: Start accepts. Automaton has 21749 states and 64098 transitions. Word has length 40 [2019-12-18 13:06:56,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:56,315 INFO L462 AbstractCegarLoop]: Abstraction has 21749 states and 64098 transitions. [2019-12-18 13:06:56,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:06:56,315 INFO L276 IsEmpty]: Start isEmpty. Operand 21749 states and 64098 transitions. [2019-12-18 13:06:56,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 13:06:56,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:56,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:56,335 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:56,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:56,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1862086557, now seen corresponding path program 1 times [2019-12-18 13:06:56,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:56,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346361419] [2019-12-18 13:06:56,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:56,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346361419] [2019-12-18 13:06:56,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:56,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:06:56,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321136686] [2019-12-18 13:06:56,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:06:56,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:56,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:06:56,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:06:56,379 INFO L87 Difference]: Start difference. First operand 21749 states and 64098 transitions. Second operand 5 states. [2019-12-18 13:06:56,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:56,464 INFO L93 Difference]: Finished difference Result 20459 states and 61324 transitions. [2019-12-18 13:06:56,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:06:56,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 13:06:56,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:56,492 INFO L225 Difference]: With dead ends: 20459 [2019-12-18 13:06:56,492 INFO L226 Difference]: Without dead ends: 18987 [2019-12-18 13:06:56,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:06:56,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18987 states. [2019-12-18 13:06:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18987 to 18987. [2019-12-18 13:06:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18987 states. [2019-12-18 13:06:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18987 states to 18987 states and 58193 transitions. [2019-12-18 13:06:56,784 INFO L78 Accepts]: Start accepts. Automaton has 18987 states and 58193 transitions. Word has length 41 [2019-12-18 13:06:56,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:56,784 INFO L462 AbstractCegarLoop]: Abstraction has 18987 states and 58193 transitions. [2019-12-18 13:06:56,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:06:56,784 INFO L276 IsEmpty]: Start isEmpty. Operand 18987 states and 58193 transitions. [2019-12-18 13:06:56,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:06:56,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:56,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:56,804 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:56,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:56,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2069069209, now seen corresponding path program 1 times [2019-12-18 13:06:56,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:56,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773110691] [2019-12-18 13:06:56,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:56,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:56,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773110691] [2019-12-18 13:06:56,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:56,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:06:56,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713720241] [2019-12-18 13:06:56,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:06:56,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:56,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:06:56,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:06:56,893 INFO L87 Difference]: Start difference. First operand 18987 states and 58193 transitions. Second operand 7 states. [2019-12-18 13:06:57,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:57,817 INFO L93 Difference]: Finished difference Result 53794 states and 162898 transitions. [2019-12-18 13:06:57,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:06:57,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:06:57,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:57,906 INFO L225 Difference]: With dead ends: 53794 [2019-12-18 13:06:57,906 INFO L226 Difference]: Without dead ends: 38153 [2019-12-18 13:06:57,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:06:58,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38153 states. [2019-12-18 13:06:58,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38153 to 22350. [2019-12-18 13:06:58,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22350 states. [2019-12-18 13:06:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22350 states to 22350 states and 67983 transitions. [2019-12-18 13:06:58,487 INFO L78 Accepts]: Start accepts. Automaton has 22350 states and 67983 transitions. Word has length 65 [2019-12-18 13:06:58,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:58,487 INFO L462 AbstractCegarLoop]: Abstraction has 22350 states and 67983 transitions. [2019-12-18 13:06:58,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:06:58,487 INFO L276 IsEmpty]: Start isEmpty. Operand 22350 states and 67983 transitions. [2019-12-18 13:06:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:06:58,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:58,512 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:58,512 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:58,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:58,513 INFO L82 PathProgramCache]: Analyzing trace with hash 721729991, now seen corresponding path program 2 times [2019-12-18 13:06:58,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:58,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113341591] [2019-12-18 13:06:58,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:58,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:58,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113341591] [2019-12-18 13:06:58,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:58,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:06:58,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411894462] [2019-12-18 13:06:58,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:06:58,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:58,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:06:58,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:06:58,599 INFO L87 Difference]: Start difference. First operand 22350 states and 67983 transitions. Second operand 8 states. [2019-12-18 13:06:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:59,811 INFO L93 Difference]: Finished difference Result 77736 states and 234061 transitions. [2019-12-18 13:06:59,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:06:59,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 13:06:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:59,900 INFO L225 Difference]: With dead ends: 77736 [2019-12-18 13:06:59,900 INFO L226 Difference]: Without dead ends: 57942 [2019-12-18 13:06:59,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 13:07:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57942 states. [2019-12-18 13:07:01,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57942 to 25699. [2019-12-18 13:07:01,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25699 states. [2019-12-18 13:07:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25699 states to 25699 states and 78191 transitions. [2019-12-18 13:07:01,099 INFO L78 Accepts]: Start accepts. Automaton has 25699 states and 78191 transitions. Word has length 65 [2019-12-18 13:07:01,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:01,099 INFO L462 AbstractCegarLoop]: Abstraction has 25699 states and 78191 transitions. [2019-12-18 13:07:01,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:07:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 25699 states and 78191 transitions. [2019-12-18 13:07:01,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:07:01,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:01,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:01,128 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:01,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:01,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1898493973, now seen corresponding path program 3 times [2019-12-18 13:07:01,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:01,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410106460] [2019-12-18 13:07:01,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:01,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410106460] [2019-12-18 13:07:01,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:01,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:07:01,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328673963] [2019-12-18 13:07:01,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:07:01,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:01,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:07:01,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:07:01,229 INFO L87 Difference]: Start difference. First operand 25699 states and 78191 transitions. Second operand 9 states. [2019-12-18 13:07:02,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:02,722 INFO L93 Difference]: Finished difference Result 73985 states and 221652 transitions. [2019-12-18 13:07:02,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:07:02,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 13:07:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:02,827 INFO L225 Difference]: With dead ends: 73985 [2019-12-18 13:07:02,827 INFO L226 Difference]: Without dead ends: 71175 [2019-12-18 13:07:02,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:07:03,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71175 states. [2019-12-18 13:07:03,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71175 to 25851. [2019-12-18 13:07:03,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25851 states. [2019-12-18 13:07:03,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25851 states to 25851 states and 78696 transitions. [2019-12-18 13:07:03,624 INFO L78 Accepts]: Start accepts. Automaton has 25851 states and 78696 transitions. Word has length 65 [2019-12-18 13:07:03,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:03,624 INFO L462 AbstractCegarLoop]: Abstraction has 25851 states and 78696 transitions. [2019-12-18 13:07:03,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:07:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 25851 states and 78696 transitions. [2019-12-18 13:07:03,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:07:03,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:03,651 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:03,651 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:03,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:03,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1422249589, now seen corresponding path program 4 times [2019-12-18 13:07:03,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:03,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821706110] [2019-12-18 13:07:03,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:03,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821706110] [2019-12-18 13:07:03,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:03,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:07:03,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886782003] [2019-12-18 13:07:03,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:07:03,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:03,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:07:03,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:07:03,753 INFO L87 Difference]: Start difference. First operand 25851 states and 78696 transitions. Second operand 9 states. [2019-12-18 13:07:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:05,483 INFO L93 Difference]: Finished difference Result 89561 states and 267871 transitions. [2019-12-18 13:07:05,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:07:05,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 13:07:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:05,608 INFO L225 Difference]: With dead ends: 89561 [2019-12-18 13:07:05,608 INFO L226 Difference]: Without dead ends: 86811 [2019-12-18 13:07:05,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:07:05,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86811 states. [2019-12-18 13:07:06,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86811 to 26066. [2019-12-18 13:07:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26066 states. [2019-12-18 13:07:06,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26066 states to 26066 states and 79516 transitions. [2019-12-18 13:07:06,497 INFO L78 Accepts]: Start accepts. Automaton has 26066 states and 79516 transitions. Word has length 65 [2019-12-18 13:07:06,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:06,497 INFO L462 AbstractCegarLoop]: Abstraction has 26066 states and 79516 transitions. [2019-12-18 13:07:06,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:07:06,497 INFO L276 IsEmpty]: Start isEmpty. Operand 26066 states and 79516 transitions. [2019-12-18 13:07:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:07:06,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:06,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:06,526 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:06,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:06,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1487237807, now seen corresponding path program 5 times [2019-12-18 13:07:06,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:06,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088472571] [2019-12-18 13:07:06,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:06,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088472571] [2019-12-18 13:07:06,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:06,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:07:06,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465899759] [2019-12-18 13:07:06,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:07:06,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:06,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:07:06,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:07:06,610 INFO L87 Difference]: Start difference. First operand 26066 states and 79516 transitions. Second operand 7 states. [2019-12-18 13:07:07,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:07,152 INFO L93 Difference]: Finished difference Result 51611 states and 155426 transitions. [2019-12-18 13:07:07,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:07:07,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:07:07,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:07,218 INFO L225 Difference]: With dead ends: 51611 [2019-12-18 13:07:07,219 INFO L226 Difference]: Without dead ends: 44547 [2019-12-18 13:07:07,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:07:07,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44547 states. [2019-12-18 13:07:08,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44547 to 26374. [2019-12-18 13:07:08,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26374 states. [2019-12-18 13:07:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26374 states to 26374 states and 80467 transitions. [2019-12-18 13:07:08,249 INFO L78 Accepts]: Start accepts. Automaton has 26374 states and 80467 transitions. Word has length 65 [2019-12-18 13:07:08,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:08,249 INFO L462 AbstractCegarLoop]: Abstraction has 26374 states and 80467 transitions. [2019-12-18 13:07:08,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:07:08,250 INFO L276 IsEmpty]: Start isEmpty. Operand 26374 states and 80467 transitions. [2019-12-18 13:07:08,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:07:08,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:08,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:08,277 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:08,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:08,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1633035801, now seen corresponding path program 6 times [2019-12-18 13:07:08,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:08,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779382503] [2019-12-18 13:07:08,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:08,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779382503] [2019-12-18 13:07:08,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:08,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:07:08,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805220774] [2019-12-18 13:07:08,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:07:08,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:08,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:07:08,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:07:08,352 INFO L87 Difference]: Start difference. First operand 26374 states and 80467 transitions. Second operand 6 states. [2019-12-18 13:07:08,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:08,760 INFO L93 Difference]: Finished difference Result 28396 states and 86134 transitions. [2019-12-18 13:07:08,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:07:08,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 13:07:08,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:08,798 INFO L225 Difference]: With dead ends: 28396 [2019-12-18 13:07:08,798 INFO L226 Difference]: Without dead ends: 28396 [2019-12-18 13:07:08,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:07:08,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28396 states. [2019-12-18 13:07:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28396 to 26576. [2019-12-18 13:07:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26576 states. [2019-12-18 13:07:09,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26576 states to 26576 states and 81128 transitions. [2019-12-18 13:07:09,240 INFO L78 Accepts]: Start accepts. Automaton has 26576 states and 81128 transitions. Word has length 65 [2019-12-18 13:07:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:09,240 INFO L462 AbstractCegarLoop]: Abstraction has 26576 states and 81128 transitions. [2019-12-18 13:07:09,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:07:09,240 INFO L276 IsEmpty]: Start isEmpty. Operand 26576 states and 81128 transitions. [2019-12-18 13:07:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:07:09,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:09,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:09,268 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:09,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:09,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1872889737, now seen corresponding path program 7 times [2019-12-18 13:07:09,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:09,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180548429] [2019-12-18 13:07:09,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:09,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180548429] [2019-12-18 13:07:09,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:09,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:07:09,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310863773] [2019-12-18 13:07:09,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:07:09,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:09,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:07:09,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:07:09,344 INFO L87 Difference]: Start difference. First operand 26576 states and 81128 transitions. Second operand 6 states. [2019-12-18 13:07:10,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:10,023 INFO L93 Difference]: Finished difference Result 44194 states and 132317 transitions. [2019-12-18 13:07:10,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:07:10,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 13:07:10,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:10,088 INFO L225 Difference]: With dead ends: 44194 [2019-12-18 13:07:10,088 INFO L226 Difference]: Without dead ends: 43991 [2019-12-18 13:07:10,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:07:10,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43991 states. [2019-12-18 13:07:10,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43991 to 28916. [2019-12-18 13:07:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28916 states. [2019-12-18 13:07:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28916 states to 28916 states and 88506 transitions. [2019-12-18 13:07:10,690 INFO L78 Accepts]: Start accepts. Automaton has 28916 states and 88506 transitions. Word has length 65 [2019-12-18 13:07:10,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:10,690 INFO L462 AbstractCegarLoop]: Abstraction has 28916 states and 88506 transitions. [2019-12-18 13:07:10,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:07:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 28916 states and 88506 transitions. [2019-12-18 13:07:10,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:07:10,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:10,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:10,725 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:10,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:10,726 INFO L82 PathProgramCache]: Analyzing trace with hash 190064407, now seen corresponding path program 8 times [2019-12-18 13:07:10,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:10,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536825023] [2019-12-18 13:07:10,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:10,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536825023] [2019-12-18 13:07:10,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:10,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:07:10,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157963451] [2019-12-18 13:07:10,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:07:10,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:10,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:07:10,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:07:10,781 INFO L87 Difference]: Start difference. First operand 28916 states and 88506 transitions. Second operand 3 states. [2019-12-18 13:07:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:11,258 INFO L93 Difference]: Finished difference Result 22804 states and 68486 transitions. [2019-12-18 13:07:11,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:07:11,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:07:11,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:11,290 INFO L225 Difference]: With dead ends: 22804 [2019-12-18 13:07:11,290 INFO L226 Difference]: Without dead ends: 22804 [2019-12-18 13:07:11,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:07:11,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22804 states. [2019-12-18 13:07:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22804 to 21779. [2019-12-18 13:07:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21779 states. [2019-12-18 13:07:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21779 states to 21779 states and 65366 transitions. [2019-12-18 13:07:11,617 INFO L78 Accepts]: Start accepts. Automaton has 21779 states and 65366 transitions. Word has length 65 [2019-12-18 13:07:11,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:11,617 INFO L462 AbstractCegarLoop]: Abstraction has 21779 states and 65366 transitions. [2019-12-18 13:07:11,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:07:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 21779 states and 65366 transitions. [2019-12-18 13:07:11,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:07:11,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:11,641 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:11,641 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:11,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:11,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1961322332, now seen corresponding path program 1 times [2019-12-18 13:07:11,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:11,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035981221] [2019-12-18 13:07:11,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:11,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035981221] [2019-12-18 13:07:11,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:11,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:07:11,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059891823] [2019-12-18 13:07:11,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:07:11,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:11,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:07:11,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:07:11,741 INFO L87 Difference]: Start difference. First operand 21779 states and 65366 transitions. Second operand 8 states. [2019-12-18 13:07:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:14,516 INFO L93 Difference]: Finished difference Result 48070 states and 141611 transitions. [2019-12-18 13:07:14,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 13:07:14,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 13:07:14,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:14,586 INFO L225 Difference]: With dead ends: 48070 [2019-12-18 13:07:14,586 INFO L226 Difference]: Without dead ends: 47798 [2019-12-18 13:07:14,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=946, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 13:07:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47798 states. [2019-12-18 13:07:15,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47798 to 24503. [2019-12-18 13:07:15,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24503 states. [2019-12-18 13:07:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24503 states to 24503 states and 73434 transitions. [2019-12-18 13:07:15,212 INFO L78 Accepts]: Start accepts. Automaton has 24503 states and 73434 transitions. Word has length 66 [2019-12-18 13:07:15,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:15,212 INFO L462 AbstractCegarLoop]: Abstraction has 24503 states and 73434 transitions. [2019-12-18 13:07:15,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:07:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 24503 states and 73434 transitions. [2019-12-18 13:07:15,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:07:15,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:15,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:15,237 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:15,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:15,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1828255542, now seen corresponding path program 2 times [2019-12-18 13:07:15,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:15,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328545064] [2019-12-18 13:07:15,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:15,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328545064] [2019-12-18 13:07:15,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:15,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:07:15,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254002942] [2019-12-18 13:07:15,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:07:15,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:15,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:07:15,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:07:15,357 INFO L87 Difference]: Start difference. First operand 24503 states and 73434 transitions. Second operand 9 states. [2019-12-18 13:07:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:19,378 INFO L93 Difference]: Finished difference Result 54423 states and 159477 transitions. [2019-12-18 13:07:19,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 13:07:19,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 13:07:19,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:19,453 INFO L225 Difference]: With dead ends: 54423 [2019-12-18 13:07:19,454 INFO L226 Difference]: Without dead ends: 54423 [2019-12-18 13:07:19,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=466, Invalid=1984, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 13:07:19,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54423 states. [2019-12-18 13:07:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54423 to 24179. [2019-12-18 13:07:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24179 states. [2019-12-18 13:07:20,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24179 states to 24179 states and 72443 transitions. [2019-12-18 13:07:20,110 INFO L78 Accepts]: Start accepts. Automaton has 24179 states and 72443 transitions. Word has length 66 [2019-12-18 13:07:20,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:20,110 INFO L462 AbstractCegarLoop]: Abstraction has 24179 states and 72443 transitions. [2019-12-18 13:07:20,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:07:20,110 INFO L276 IsEmpty]: Start isEmpty. Operand 24179 states and 72443 transitions. [2019-12-18 13:07:20,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:07:20,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:20,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:20,137 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:20,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:20,137 INFO L82 PathProgramCache]: Analyzing trace with hash -178270044, now seen corresponding path program 3 times [2019-12-18 13:07:20,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:20,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736759271] [2019-12-18 13:07:20,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:20,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736759271] [2019-12-18 13:07:20,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:20,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:07:20,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350007646] [2019-12-18 13:07:20,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:07:20,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:20,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:07:20,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:07:20,225 INFO L87 Difference]: Start difference. First operand 24179 states and 72443 transitions. Second operand 8 states. [2019-12-18 13:07:21,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:21,441 INFO L93 Difference]: Finished difference Result 46046 states and 137730 transitions. [2019-12-18 13:07:21,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:07:21,442 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 13:07:21,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:21,501 INFO L225 Difference]: With dead ends: 46046 [2019-12-18 13:07:21,501 INFO L226 Difference]: Without dead ends: 37852 [2019-12-18 13:07:21,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:07:21,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37852 states. [2019-12-18 13:07:22,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37852 to 24928. [2019-12-18 13:07:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24928 states. [2019-12-18 13:07:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24928 states to 24928 states and 74208 transitions. [2019-12-18 13:07:22,227 INFO L78 Accepts]: Start accepts. Automaton has 24928 states and 74208 transitions. Word has length 66 [2019-12-18 13:07:22,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:22,227 INFO L462 AbstractCegarLoop]: Abstraction has 24928 states and 74208 transitions. [2019-12-18 13:07:22,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:07:22,227 INFO L276 IsEmpty]: Start isEmpty. Operand 24928 states and 74208 transitions. [2019-12-18 13:07:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:07:22,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:22,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:22,254 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:22,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:22,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1109171142, now seen corresponding path program 4 times [2019-12-18 13:07:22,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:22,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844818325] [2019-12-18 13:07:22,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:22,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844818325] [2019-12-18 13:07:22,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:22,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:07:22,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412495967] [2019-12-18 13:07:22,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:07:22,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:22,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:07:22,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:07:22,372 INFO L87 Difference]: Start difference. First operand 24928 states and 74208 transitions. Second operand 9 states. [2019-12-18 13:07:23,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:23,840 INFO L93 Difference]: Finished difference Result 43430 states and 129066 transitions. [2019-12-18 13:07:23,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:07:23,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 13:07:23,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:23,894 INFO L225 Difference]: With dead ends: 43430 [2019-12-18 13:07:23,894 INFO L226 Difference]: Without dead ends: 37204 [2019-12-18 13:07:23,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:07:24,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37204 states. [2019-12-18 13:07:24,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37204 to 24712. [2019-12-18 13:07:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24712 states. [2019-12-18 13:07:24,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24712 states to 24712 states and 73520 transitions. [2019-12-18 13:07:24,392 INFO L78 Accepts]: Start accepts. Automaton has 24712 states and 73520 transitions. Word has length 66 [2019-12-18 13:07:24,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:24,393 INFO L462 AbstractCegarLoop]: Abstraction has 24712 states and 73520 transitions. [2019-12-18 13:07:24,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:07:24,393 INFO L276 IsEmpty]: Start isEmpty. Operand 24712 states and 73520 transitions. [2019-12-18 13:07:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:07:24,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:24,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:24,422 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:24,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:24,422 INFO L82 PathProgramCache]: Analyzing trace with hash 191706936, now seen corresponding path program 5 times [2019-12-18 13:07:24,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:24,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308417224] [2019-12-18 13:07:24,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:24,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308417224] [2019-12-18 13:07:24,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:24,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:07:24,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956069819] [2019-12-18 13:07:24,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:07:24,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:24,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:07:24,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:07:24,584 INFO L87 Difference]: Start difference. First operand 24712 states and 73520 transitions. Second operand 11 states. [2019-12-18 13:07:25,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:25,851 INFO L93 Difference]: Finished difference Result 49837 states and 148577 transitions. [2019-12-18 13:07:25,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 13:07:25,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 13:07:25,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:25,918 INFO L225 Difference]: With dead ends: 49837 [2019-12-18 13:07:25,918 INFO L226 Difference]: Without dead ends: 46998 [2019-12-18 13:07:25,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 13:07:26,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46998 states. [2019-12-18 13:07:26,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46998 to 27491. [2019-12-18 13:07:26,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27491 states. [2019-12-18 13:07:26,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27491 states to 27491 states and 81223 transitions. [2019-12-18 13:07:26,826 INFO L78 Accepts]: Start accepts. Automaton has 27491 states and 81223 transitions. Word has length 66 [2019-12-18 13:07:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:26,826 INFO L462 AbstractCegarLoop]: Abstraction has 27491 states and 81223 transitions. [2019-12-18 13:07:26,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:07:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 27491 states and 81223 transitions. [2019-12-18 13:07:26,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:07:26,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:26,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:26,854 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:26,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:26,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2025639272, now seen corresponding path program 6 times [2019-12-18 13:07:26,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:26,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233231512] [2019-12-18 13:07:26,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:27,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233231512] [2019-12-18 13:07:27,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:27,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:07:27,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162705273] [2019-12-18 13:07:27,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:07:27,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:27,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:07:27,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:07:27,025 INFO L87 Difference]: Start difference. First operand 27491 states and 81223 transitions. Second operand 11 states. [2019-12-18 13:07:28,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:28,022 INFO L93 Difference]: Finished difference Result 47511 states and 140299 transitions. [2019-12-18 13:07:28,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:07:28,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 13:07:28,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:28,080 INFO L225 Difference]: With dead ends: 47511 [2019-12-18 13:07:28,081 INFO L226 Difference]: Without dead ends: 40909 [2019-12-18 13:07:28,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:07:28,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40909 states. [2019-12-18 13:07:28,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40909 to 23888. [2019-12-18 13:07:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23888 states. [2019-12-18 13:07:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23888 states to 23888 states and 71103 transitions. [2019-12-18 13:07:28,618 INFO L78 Accepts]: Start accepts. Automaton has 23888 states and 71103 transitions. Word has length 66 [2019-12-18 13:07:28,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:28,618 INFO L462 AbstractCegarLoop]: Abstraction has 23888 states and 71103 transitions. [2019-12-18 13:07:28,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:07:28,619 INFO L276 IsEmpty]: Start isEmpty. Operand 23888 states and 71103 transitions. [2019-12-18 13:07:28,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:07:28,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:28,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:28,649 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:28,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:28,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1594558236, now seen corresponding path program 7 times [2019-12-18 13:07:28,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:28,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554270944] [2019-12-18 13:07:28,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:28,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:28,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554270944] [2019-12-18 13:07:28,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:28,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:07:28,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595167057] [2019-12-18 13:07:28,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:07:28,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:28,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:07:28,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:07:28,744 INFO L87 Difference]: Start difference. First operand 23888 states and 71103 transitions. Second operand 4 states. [2019-12-18 13:07:28,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:28,896 INFO L93 Difference]: Finished difference Result 26270 states and 78042 transitions. [2019-12-18 13:07:28,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:07:28,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 13:07:28,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:28,930 INFO L225 Difference]: With dead ends: 26270 [2019-12-18 13:07:28,930 INFO L226 Difference]: Without dead ends: 26270 [2019-12-18 13:07:28,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:07:29,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26270 states. [2019-12-18 13:07:29,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26270 to 21869. [2019-12-18 13:07:29,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21869 states. [2019-12-18 13:07:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21869 states to 21869 states and 65185 transitions. [2019-12-18 13:07:29,293 INFO L78 Accepts]: Start accepts. Automaton has 21869 states and 65185 transitions. Word has length 66 [2019-12-18 13:07:29,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:29,293 INFO L462 AbstractCegarLoop]: Abstraction has 21869 states and 65185 transitions. [2019-12-18 13:07:29,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:07:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 21869 states and 65185 transitions. [2019-12-18 13:07:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:07:29,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:29,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:29,315 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:29,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:29,316 INFO L82 PathProgramCache]: Analyzing trace with hash 765672949, now seen corresponding path program 1 times [2019-12-18 13:07:29,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:29,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410268594] [2019-12-18 13:07:29,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:29,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:29,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410268594] [2019-12-18 13:07:29,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:29,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:07:29,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156234985] [2019-12-18 13:07:29,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:07:29,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:29,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:07:29,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:07:29,483 INFO L87 Difference]: Start difference. First operand 21869 states and 65185 transitions. Second operand 12 states. [2019-12-18 13:07:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:30,446 INFO L93 Difference]: Finished difference Result 37845 states and 112768 transitions. [2019-12-18 13:07:30,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:07:30,447 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 13:07:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:30,497 INFO L225 Difference]: With dead ends: 37845 [2019-12-18 13:07:30,497 INFO L226 Difference]: Without dead ends: 37420 [2019-12-18 13:07:30,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:07:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37420 states. [2019-12-18 13:07:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37420 to 21615. [2019-12-18 13:07:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21615 states. [2019-12-18 13:07:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21615 states to 21615 states and 64541 transitions. [2019-12-18 13:07:31,111 INFO L78 Accepts]: Start accepts. Automaton has 21615 states and 64541 transitions. Word has length 67 [2019-12-18 13:07:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:31,111 INFO L462 AbstractCegarLoop]: Abstraction has 21615 states and 64541 transitions. [2019-12-18 13:07:31,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:07:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 21615 states and 64541 transitions. [2019-12-18 13:07:31,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:07:31,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:31,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:31,132 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:31,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:31,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1127178005, now seen corresponding path program 2 times [2019-12-18 13:07:31,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:31,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857685858] [2019-12-18 13:07:31,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:07:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:07:31,236 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:07:31,236 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:07:31,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t751~0.offset_29|) (= 0 v_~z$r_buff1_thd3~0_333) (= 0 v_~__unbuffered_cnt~0_79) (= v_~z~0_222 0) (= 0 v_~x~0_150) (= 0 v_~z$flush_delayed~0_66) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t751~0.base_43|)) (= (store .cse0 |v_ULTIMATE.start_main_~#t751~0.base_43| 1) |v_#valid_80|) (= v_~__unbuffered_p2_EBX~0_70 0) (= v_~y~0_71 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$r_buff0_thd1~0_186 0) (= v_~z$w_buff1_used~0_670 0) (= v_~z$r_buff0_thd2~0_110 0) (= 0 v_~weak$$choice0~0_29) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t751~0.base_43| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t751~0.base_43|) |v_ULTIMATE.start_main_~#t751~0.offset_29| 0)) |v_#memory_int_17|) (= v_~z$w_buff0~0_701 0) (= v_~z$r_buff1_thd0~0_201 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff0_thd3~0_363) (= 0 v_~__unbuffered_p2_EAX~0_62) (= |v_#NULL.offset_5| 0) (= v_~z$mem_tmp~0_43 0) (= v_~z$r_buff0_thd0~0_137 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t751~0.base_43| 4)) (= v_~weak$$choice2~0_160 0) (= v_~z$r_buff1_thd1~0_144 0) (= v_~z$r_buff1_thd2~0_165 0) (= v_~z$w_buff0_used~0_1072 0) (= v_~z$w_buff1~0_410 0) (= v_~main$tmp_guard0~0_24 0) (= v_~main$tmp_guard1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t751~0.base_43|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_46|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t751~0.base=|v_ULTIMATE.start_main_~#t751~0.base_43|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_202|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_120|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ULTIMATE.start_main_~#t751~0.offset=|v_ULTIMATE.start_main_~#t751~0.offset_29|, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~z$mem_tmp~0=v_~z$mem_tmp~0_43, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_670, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_144, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_363, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ULTIMATE.start_main_~#t753~0.base=|v_ULTIMATE.start_main_~#t753~0.base_29|, ~x~0=v_~x~0_150, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_410, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_74|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_34|, ULTIMATE.start_main_~#t752~0.base=|v_ULTIMATE.start_main_~#t752~0.base_37|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_201, ~y~0=v_~y~0_71, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_110, ULTIMATE.start_main_~#t753~0.offset=|v_ULTIMATE.start_main_~#t753~0.offset_21|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_26|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1072, ~z$w_buff0~0=v_~z$w_buff0~0_701, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_333, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t752~0.offset=|v_ULTIMATE.start_main_~#t752~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_80|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_222, ~weak$$choice2~0=v_~weak$$choice2~0_160, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_186} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_~#t751~0.base, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t752~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t751~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t753~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t752~0.offset, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t753~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 13:07:31,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L823-1-->L825: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t752~0.offset_10|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t752~0.base_11|) 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t752~0.base_11| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t752~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t752~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t752~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t752~0.base_11|) |v_ULTIMATE.start_main_~#t752~0.offset_10| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t752~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t752~0.base=|v_ULTIMATE.start_main_~#t752~0.base_11|, ULTIMATE.start_main_~#t752~0.offset=|v_ULTIMATE.start_main_~#t752~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t752~0.base, ULTIMATE.start_main_~#t752~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 13:07:31,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_23 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|) (= v_~z$w_buff0_used~0_174 1) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= v_~z$w_buff0~0_53 v_~z$w_buff1~0_38) (= v_~z$w_buff0_used~0_175 v_~z$w_buff1_used~0_104) (= (mod v_~z$w_buff1_used~0_104 256) 0) (= 1 v_~z$w_buff0~0_52)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~z$w_buff0~0=v_~z$w_buff0~0_53, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_174, ~z$w_buff0~0=v_~z$w_buff0~0_52, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_104, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~z$w_buff1~0=v_~z$w_buff1~0_38, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 13:07:31,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L825-1-->L827: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t753~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t753~0.base_10|) |v_ULTIMATE.start_main_~#t753~0.offset_9| 2)) |v_#memory_int_11|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t753~0.base_10|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t753~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t753~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t753~0.base_10|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t753~0.base_10| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t753~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t753~0.offset=|v_ULTIMATE.start_main_~#t753~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t753~0.base=|v_ULTIMATE.start_main_~#t753~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t753~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t753~0.base] because there is no mapped edge [2019-12-18 13:07:31,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L764-2-->L764-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1340648329 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In1340648329 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out1340648329| ~z~0_In1340648329) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out1340648329| ~z$w_buff1~0_In1340648329) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1340648329, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1340648329, ~z$w_buff1~0=~z$w_buff1~0_In1340648329, ~z~0=~z~0_In1340648329} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1340648329|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1340648329, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1340648329, ~z$w_buff1~0=~z$w_buff1~0_In1340648329, ~z~0=~z~0_In1340648329} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 13:07:31,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-136663262 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_In-136663262| |P2Thread1of1ForFork2_#t~ite20_Out-136663262|) (= ~z$w_buff0~0_In-136663262 |P2Thread1of1ForFork2_#t~ite21_Out-136663262|) (not .cse0)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-136663262| ~z$w_buff0~0_In-136663262) (= |P2Thread1of1ForFork2_#t~ite20_Out-136663262| |P2Thread1of1ForFork2_#t~ite21_Out-136663262|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-136663262 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-136663262 256))) (= (mod ~z$w_buff0_used~0_In-136663262 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-136663262 256)))))))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-136663262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-136663262, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In-136663262|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-136663262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-136663262, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-136663262, ~weak$$choice2~0=~weak$$choice2~0_In-136663262} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-136663262, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-136663262|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-136663262, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out-136663262|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-136663262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-136663262, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-136663262, ~weak$$choice2~0=~weak$$choice2~0_In-136663262} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 13:07:31,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In125823701 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In125823701 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out125823701| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out125823701| ~z$w_buff0_used~0_In125823701) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In125823701, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In125823701} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out125823701|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In125823701, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In125823701} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:07:31,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1402730083 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1402730083 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1402730083 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In1402730083 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1402730083|)) (and (= ~z$w_buff1_used~0_In1402730083 |P0Thread1of1ForFork0_#t~ite6_Out1402730083|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1402730083, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1402730083, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1402730083, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1402730083} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1402730083|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1402730083, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1402730083, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1402730083, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1402730083} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:07:31,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2134521839 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-2134521839 256) 0))) (or (and (= ~z$r_buff0_thd1~0_Out-2134521839 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In-2134521839 ~z$r_buff0_thd1~0_Out-2134521839)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2134521839, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2134521839} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2134521839, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2134521839|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-2134521839} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:07:31,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L748-->L748-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-743639206 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-743639206 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-743639206 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-743639206 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-743639206| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-743639206| ~z$r_buff1_thd1~0_In-743639206) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-743639206, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-743639206, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-743639206, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-743639206} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-743639206, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-743639206|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-743639206, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-743639206, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-743639206} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:07:31,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L748-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_62 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_62, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:07:31,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-390281085 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-390281085 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-390281085 256)) (and (= (mod ~z$r_buff1_thd3~0_In-390281085 256) 0) .cse1) (and (= (mod ~z$w_buff1_used~0_In-390281085 256) 0) .cse1))) (= |P2Thread1of1ForFork2_#t~ite24_Out-390281085| |P2Thread1of1ForFork2_#t~ite23_Out-390281085|) (= ~z$w_buff1~0_In-390281085 |P2Thread1of1ForFork2_#t~ite23_Out-390281085|)) (and (= |P2Thread1of1ForFork2_#t~ite24_Out-390281085| ~z$w_buff1~0_In-390281085) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In-390281085| |P2Thread1of1ForFork2_#t~ite23_Out-390281085|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-390281085|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-390281085, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-390281085, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-390281085, ~z$w_buff1~0=~z$w_buff1~0_In-390281085, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-390281085, ~weak$$choice2~0=~weak$$choice2~0_In-390281085} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-390281085|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-390281085|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-390281085, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-390281085, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-390281085, ~z$w_buff1~0=~z$w_buff1~0_In-390281085, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-390281085, ~weak$$choice2~0=~weak$$choice2~0_In-390281085} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 13:07:31,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L791-->L791-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1028993432 256) 0))) (or (and .cse0 (= ~z$w_buff0_used~0_In1028993432 |P2Thread1of1ForFork2_#t~ite26_Out1028993432|) (= |P2Thread1of1ForFork2_#t~ite27_Out1028993432| |P2Thread1of1ForFork2_#t~ite26_Out1028993432|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1028993432 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In1028993432 256)) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In1028993432 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1028993432 256))))) (and (= |P2Thread1of1ForFork2_#t~ite26_In1028993432| |P2Thread1of1ForFork2_#t~ite26_Out1028993432|) (= |P2Thread1of1ForFork2_#t~ite27_Out1028993432| ~z$w_buff0_used~0_In1028993432) (not .cse0)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In1028993432|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1028993432, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1028993432, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1028993432, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1028993432, ~weak$$choice2~0=~weak$$choice2~0_In1028993432} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out1028993432|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1028993432, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1028993432, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1028993432, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1028993432, ~weak$$choice2~0=~weak$$choice2~0_In1028993432, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out1028993432|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 13:07:31,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L793-->L794: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~z$r_buff0_thd3~0_119 v_~z$r_buff0_thd3~0_118)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_119, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_8|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 13:07:31,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-4-->L765: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~z~0_16) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 13:07:31,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-980081733 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-980081733 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-980081733| ~z$w_buff0_used~0_In-980081733)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-980081733| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-980081733, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-980081733} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-980081733, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-980081733|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-980081733} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 13:07:31,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1298977107 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1298977107 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1298977107 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1298977107 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out1298977107| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1298977107 |P1Thread1of1ForFork1_#t~ite12_Out1298977107|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1298977107, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1298977107, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1298977107, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1298977107} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1298977107, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1298977107, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1298977107, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1298977107|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1298977107} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:07:31,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1933236173 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1933236173 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1933236173|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-1933236173| ~z$r_buff0_thd2~0_In-1933236173)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1933236173, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1933236173} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1933236173, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1933236173|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1933236173} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 13:07:31,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L796-->L800: Formula: (and (= v_~z~0_64 v_~z$mem_tmp~0_7) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 13:07:31,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L800-2-->L800-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out-1759521446| |P2Thread1of1ForFork2_#t~ite39_Out-1759521446|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1759521446 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1759521446 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork2_#t~ite38_Out-1759521446| ~z~0_In-1759521446)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out-1759521446| ~z$w_buff1~0_In-1759521446) (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1759521446, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1759521446, ~z$w_buff1~0=~z$w_buff1~0_In-1759521446, ~z~0=~z~0_In-1759521446} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1759521446, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1759521446, ~z$w_buff1~0=~z$w_buff1~0_In-1759521446, ~z~0=~z~0_In-1759521446, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-1759521446|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1759521446|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 13:07:31,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-536732647 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-536732647 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-536732647|)) (and (= ~z$w_buff0_used~0_In-536732647 |P2Thread1of1ForFork2_#t~ite40_Out-536732647|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-536732647, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-536732647} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-536732647, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-536732647, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-536732647|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 13:07:31,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In613926938 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In613926938 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In613926938 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In613926938 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out613926938| ~z$w_buff1_used~0_In613926938) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite41_Out613926938| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In613926938, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In613926938, ~z$w_buff1_used~0=~z$w_buff1_used~0_In613926938, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In613926938} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out613926938|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In613926938, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In613926938, ~z$w_buff1_used~0=~z$w_buff1_used~0_In613926938, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In613926938} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 13:07:31,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L768-->L768-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd2~0_In1114620541 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1114620541 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1114620541 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1114620541 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1114620541|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1114620541| ~z$r_buff1_thd2~0_In1114620541)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1114620541, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1114620541, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1114620541, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1114620541} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1114620541, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1114620541, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1114620541, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1114620541|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1114620541} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 13:07:31,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_70) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_70, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 13:07:31,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1339521192 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1339521192 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out1339521192| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out1339521192| ~z$r_buff0_thd3~0_In1339521192)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1339521192, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1339521192} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out1339521192|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1339521192, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1339521192} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 13:07:31,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L804-->L804-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In288526506 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In288526506 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In288526506 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In288526506 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite43_Out288526506| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite43_Out288526506| ~z$r_buff1_thd3~0_In288526506) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In288526506, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In288526506, ~z$w_buff1_used~0=~z$w_buff1_used~0_In288526506, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In288526506} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In288526506, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In288526506, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out288526506|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In288526506, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In288526506} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 13:07:31,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L804-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= v_~z$r_buff1_thd3~0_119 |v_P2Thread1of1ForFork2_#t~ite43_28|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_119, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_27|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 13:07:31,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L827-1-->L833: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:07:31,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L833-2-->L833-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In190733689 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In190733689 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out190733689| |ULTIMATE.start_main_#t~ite48_Out190733689|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out190733689| ~z~0_In190733689) .cse2) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out190733689| ~z$w_buff1~0_In190733689) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In190733689, ~z$w_buff1_used~0=~z$w_buff1_used~0_In190733689, ~z$w_buff1~0=~z$w_buff1~0_In190733689, ~z~0=~z~0_In190733689} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In190733689, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out190733689|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In190733689, ~z$w_buff1~0=~z$w_buff1~0_In190733689, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out190733689|, ~z~0=~z~0_In190733689} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:07:31,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1637027164 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1637027164 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1637027164 |ULTIMATE.start_main_#t~ite49_Out-1637027164|)) (and (= |ULTIMATE.start_main_#t~ite49_Out-1637027164| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1637027164, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1637027164} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1637027164, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1637027164, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1637027164|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:07:31,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L835-->L835-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1380092603 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1380092603 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1380092603 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1380092603 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1380092603 |ULTIMATE.start_main_#t~ite50_Out-1380092603|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-1380092603|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1380092603, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1380092603, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1380092603, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1380092603} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1380092603|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1380092603, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1380092603, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1380092603, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1380092603} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:07:31,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In111151249 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In111151249 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out111151249| ~z$r_buff0_thd0~0_In111151249) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out111151249| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In111151249, ~z$w_buff0_used~0=~z$w_buff0_used~0_In111151249} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In111151249, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out111151249|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In111151249} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:07:31,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1451222975 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1451222975 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1451222975 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1451222975 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out1451222975| ~z$r_buff1_thd0~0_In1451222975) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite52_Out1451222975| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1451222975, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1451222975, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1451222975, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1451222975} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1451222975|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1451222975, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1451222975, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1451222975, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1451222975} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:07:31,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_37 2) (= 2 v_~__unbuffered_p2_EAX~0_30) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~__unbuffered_p2_EBX~0_37 0) (= 2 v_~x~0_117) (= v_~main$tmp_guard1~0_27 0) (= (mod v_~main$tmp_guard1~0_27 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_162 |v_ULTIMATE.start_main_#t~ite52_69|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_69|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_37, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~y~0=v_~y~0_37, ~x~0=v_~x~0_117} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_162, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~y~0=v_~y~0_37, ~x~0=v_~x~0_117, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:07:31,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:07:31 BasicIcfg [2019-12-18 13:07:31,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:07:31,372 INFO L168 Benchmark]: Toolchain (without parser) took 130105.41 ms. Allocated memory was 138.9 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 101.9 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 13:07:31,372 INFO L168 Benchmark]: CDTParser took 1.41 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:07:31,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.87 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.5 MB in the beginning and 157.3 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:07:31,373 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.19 ms. Allocated memory is still 203.9 MB. Free memory was 157.3 MB in the beginning and 154.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:07:31,374 INFO L168 Benchmark]: Boogie Preprocessor took 39.59 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:07:31,374 INFO L168 Benchmark]: RCFGBuilder took 786.70 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 102.4 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:07:31,374 INFO L168 Benchmark]: TraceAbstraction took 128427.27 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 13:07:31,377 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 783.87 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.5 MB in the beginning and 157.3 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.19 ms. Allocated memory is still 203.9 MB. Free memory was 157.3 MB in the beginning and 154.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.59 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 786.70 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 102.4 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 128427.27 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 175 ProgramPointsBefore, 93 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 6798 VarBasedMoverChecksPositive, 289 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 285 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 87070 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t751, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t752, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t753, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L785] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L786] 3 z$flush_delayed = weak$$choice2 [L787] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L788] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L790] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L791] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L792] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L792] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L794] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L801] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L802] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L803] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L834] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L835] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L836] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 128.0s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 46.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10073 SDtfs, 14265 SDslu, 33959 SDs, 0 SdLazy, 18928 SolverSat, 731 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 572 GetRequests, 87 SyntacticMatches, 34 SemanticMatches, 451 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2573 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151934occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 51.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 532044 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1726 NumberOfCodeBlocks, 1726 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1622 ConstructedInterpolants, 0 QuantifiedInterpolants, 368136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...