/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/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:59:08,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:59:08,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:59:08,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:59:08,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:59:08,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:59:08,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:59:08,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:59:08,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:59:08,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:59:08,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:59:08,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:59:08,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:59:08,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:59:08,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:59:08,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:59:08,989 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:59:08,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:59:08,992 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:59:08,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:59:08,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:59:08,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:59:08,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:59:09,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:59:09,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:59:09,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:59:09,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:59:09,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:59:09,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:59:09,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:59:09,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:59:09,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:59:09,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:59:09,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:59:09,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:59:09,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:59:09,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:59:09,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:59:09,012 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:59:09,013 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:59:09,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:59:09,015 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-21 23:59:09,043 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:59:09,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:59:09,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:59:09,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:59:09,045 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:59:09,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:59:09,046 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:59:09,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:59:09,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:59:09,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:59:09,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:59:09,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:59:09,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:59:09,047 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:59:09,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:59:09,047 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:59:09,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:59:09,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:59:09,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:59:09,048 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:59:09,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:59:09,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:59:09,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:59:09,049 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:59:09,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:59:09,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:59:09,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:59:09,050 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-21 23:59:09,050 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:59:09,050 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:59:09,050 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-21 23:59:09,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:59:09,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:59:09,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:59:09,418 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:59:09,418 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:59:09,419 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i [2020-10-21 23:59:09,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c88d1e5a/702cb8d49da24747a733e72f2c878ac1/FLAGf095439e0 [2020-10-21 23:59:10,079 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:59:10,079 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i [2020-10-21 23:59:10,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c88d1e5a/702cb8d49da24747a733e72f2c878ac1/FLAGf095439e0 [2020-10-21 23:59:10,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c88d1e5a/702cb8d49da24747a733e72f2c878ac1 [2020-10-21 23:59:10,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:59:10,288 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:59:10,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:59:10,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:59:10,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:59:10,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:59:10" (1/1) ... [2020-10-21 23:59:10,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fe64605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:59:10, skipping insertion in model container [2020-10-21 23:59:10,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:59:10" (1/1) ... [2020-10-21 23:59:10,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:59:10,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:59:10,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:59:10,996 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:59:11,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:59:11,134 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:59:11,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:59:11 WrapperNode [2020-10-21 23:59:11,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:59:11,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:59:11,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:59:11,136 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:59:11,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:59:11" (1/1) ... [2020-10-21 23:59:11,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:59:11" (1/1) ... [2020-10-21 23:59:11,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:59:11,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:59:11,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:59:11,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:59:11,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:59:11" (1/1) ... [2020-10-21 23:59:11,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:59:11" (1/1) ... [2020-10-21 23:59:11,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:59:11" (1/1) ... [2020-10-21 23:59:11,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:59:11" (1/1) ... [2020-10-21 23:59:11,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:59:11" (1/1) ... [2020-10-21 23:59:11,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:59:11" (1/1) ... [2020-10-21 23:59:11,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:59:11" (1/1) ... [2020-10-21 23:59:11,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:59:11,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:59:11,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:59:11,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:59:11,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:59:11" (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 [2020-10-21 23:59:11,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:59:11,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:59:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:59:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:59:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:59:11,360 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:59:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:59:11,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:59:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:59:11,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:59:11,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:59:11,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:59:11,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:59:11,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:59:11,364 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 23:59:13,461 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:59:13,462 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:59:13,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:59:13 BoogieIcfgContainer [2020-10-21 23:59:13,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:59:13,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:59:13,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:59:13,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:59:13,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:59:10" (1/3) ... [2020-10-21 23:59:13,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48232e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:59:13, skipping insertion in model container [2020-10-21 23:59:13,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:59:11" (2/3) ... [2020-10-21 23:59:13,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48232e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:59:13, skipping insertion in model container [2020-10-21 23:59:13,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:59:13" (3/3) ... [2020-10-21 23:59:13,474 INFO L111 eAbstractionObserver]: Analyzing ICFG mix006_power.oepc.i [2020-10-21 23:59:13,487 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:59:13,487 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:59:13,496 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:59:13,497 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:59:13,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,531 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,531 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,532 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,533 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,536 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,536 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,536 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,536 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,536 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,539 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,539 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,554 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,555 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,555 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,555 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,555 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,555 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,556 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,556 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,556 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,556 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,556 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,559 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,559 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,564 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,566 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:59:13,570 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:59:13,584 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-21 23:59:13,606 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:59:13,607 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:59:13,607 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:59:13,607 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-21 23:59:13,607 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:59:13,607 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:59:13,607 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:59:13,608 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:59:13,622 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:59:13,623 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 106 transitions, 227 flow [2020-10-21 23:59:13,626 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 106 transitions, 227 flow [2020-10-21 23:59:13,628 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 113 places, 106 transitions, 227 flow [2020-10-21 23:59:13,678 INFO L129 PetriNetUnfolder]: 3/103 cut-off events. [2020-10-21 23:59:13,679 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:59:13,684 INFO L80 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 3/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2020-10-21 23:59:13,688 INFO L116 LiptonReduction]: Number of co-enabled transitions 2064 [2020-10-21 23:59:14,497 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 23:59:15,005 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 23:59:16,117 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-10-21 23:59:16,668 WARN L193 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-10-21 23:59:16,850 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-21 23:59:16,859 INFO L131 LiptonReduction]: Checked pairs total: 6466 [2020-10-21 23:59:16,859 INFO L133 LiptonReduction]: Total number of compositions: 92 [2020-10-21 23:59:16,865 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 75 flow [2020-10-21 23:59:16,969 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1382 states. [2020-10-21 23:59:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states. [2020-10-21 23:59:16,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-21 23:59:16,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:59:16,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-21 23:59:16,999 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:59:17,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:59:17,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1106133, now seen corresponding path program 1 times [2020-10-21 23:59:17,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:59:17,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65226531] [2020-10-21 23:59:17,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:59:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:59:17,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:59:17,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65226531] [2020-10-21 23:59:17,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:59:17,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:59:17,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [6306304] [2020-10-21 23:59:17,316 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:59:17,319 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:59:17,333 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-21 23:59:17,333 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:59:17,337 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-21 23:59:17,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:59:17,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:59:17,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:59:17,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:59:17,357 INFO L87 Difference]: Start difference. First operand 1382 states. Second operand 3 states. [2020-10-21 23:59:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:59:17,467 INFO L93 Difference]: Finished difference Result 1152 states and 3742 transitions. [2020-10-21 23:59:17,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:59:17,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-21 23:59:17,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:59:17,504 INFO L225 Difference]: With dead ends: 1152 [2020-10-21 23:59:17,504 INFO L226 Difference]: Without dead ends: 972 [2020-10-21 23:59:17,548 INFO L677 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 [2020-10-21 23:59:17,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2020-10-21 23:59:17,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2020-10-21 23:59:17,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2020-10-21 23:59:17,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3118 transitions. [2020-10-21 23:59:17,724 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 3118 transitions. Word has length 3 [2020-10-21 23:59:17,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:59:17,724 INFO L481 AbstractCegarLoop]: Abstraction has 972 states and 3118 transitions. [2020-10-21 23:59:17,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:59:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 3118 transitions. [2020-10-21 23:59:17,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 23:59:17,727 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:59:17,727 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:59:17,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:59:17,728 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:59:17,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:59:17,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1181966321, now seen corresponding path program 1 times [2020-10-21 23:59:17,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:59:17,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012720215] [2020-10-21 23:59:17,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:59:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:59:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:59:17,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012720215] [2020-10-21 23:59:17,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:59:17,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:59:17,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1520826908] [2020-10-21 23:59:17,868 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:59:17,870 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:59:17,872 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-21 23:59:17,872 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:59:17,872 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-21 23:59:17,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:59:17,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:59:17,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:59:17,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:59:17,875 INFO L87 Difference]: Start difference. First operand 972 states and 3118 transitions. Second operand 4 states. [2020-10-21 23:59:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:59:17,912 INFO L93 Difference]: Finished difference Result 1032 states and 3186 transitions. [2020-10-21 23:59:17,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:59:17,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-21 23:59:17,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:59:17,920 INFO L225 Difference]: With dead ends: 1032 [2020-10-21 23:59:17,920 INFO L226 Difference]: Without dead ends: 852 [2020-10-21 23:59:17,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:59:17,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2020-10-21 23:59:17,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2020-10-21 23:59:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2020-10-21 23:59:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 2682 transitions. [2020-10-21 23:59:17,957 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 2682 transitions. Word has length 10 [2020-10-21 23:59:17,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:59:17,958 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 2682 transitions. [2020-10-21 23:59:17,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:59:17,959 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 2682 transitions. [2020-10-21 23:59:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:59:17,962 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:59:17,962 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:59:17,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:59:17,962 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:59:17,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:59:17,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1102814956, now seen corresponding path program 1 times [2020-10-21 23:59:17,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:59:17,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551320822] [2020-10-21 23:59:17,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:59:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:59:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:59:18,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551320822] [2020-10-21 23:59:18,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:59:18,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:59:18,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1221136594] [2020-10-21 23:59:18,073 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:59:18,077 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:59:18,082 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 28 transitions. [2020-10-21 23:59:18,082 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:59:18,196 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-21 23:59:18,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:59:18,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:59:18,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:59:18,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:59:18,198 INFO L87 Difference]: Start difference. First operand 852 states and 2682 transitions. Second operand 4 states. [2020-10-21 23:59:18,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:59:18,225 INFO L93 Difference]: Finished difference Result 892 states and 2724 transitions. [2020-10-21 23:59:18,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:59:18,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-21 23:59:18,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:59:18,232 INFO L225 Difference]: With dead ends: 892 [2020-10-21 23:59:18,233 INFO L226 Difference]: Without dead ends: 772 [2020-10-21 23:59:18,233 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:59:18,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2020-10-21 23:59:18,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2020-10-21 23:59:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-10-21 23:59:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 2398 transitions. [2020-10-21 23:59:18,267 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 2398 transitions. Word has length 12 [2020-10-21 23:59:18,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:59:18,267 INFO L481 AbstractCegarLoop]: Abstraction has 772 states and 2398 transitions. [2020-10-21 23:59:18,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:59:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 2398 transitions. [2020-10-21 23:59:18,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:59:18,270 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:59:18,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:59:18,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:59:18,271 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:59:18,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:59:18,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1052543848, now seen corresponding path program 1 times [2020-10-21 23:59:18,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:59:18,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426224760] [2020-10-21 23:59:18,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:59:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:59:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:59:18,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426224760] [2020-10-21 23:59:18,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:59:18,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:59:18,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [309271558] [2020-10-21 23:59:18,366 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:59:18,368 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:59:18,374 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 70 transitions. [2020-10-21 23:59:18,374 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:59:18,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:18,536 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:18,604 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:18,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:18,852 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [11167#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-21 23:59:18,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:59:18,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:59:18,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:59:18,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:59:18,854 INFO L87 Difference]: Start difference. First operand 772 states and 2398 transitions. Second operand 5 states. [2020-10-21 23:59:18,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:59:18,920 INFO L93 Difference]: Finished difference Result 484 states and 1331 transitions. [2020-10-21 23:59:18,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:59:18,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-21 23:59:18,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:59:18,923 INFO L225 Difference]: With dead ends: 484 [2020-10-21 23:59:18,923 INFO L226 Difference]: Without dead ends: 304 [2020-10-21 23:59:18,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:59:18,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-10-21 23:59:18,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2020-10-21 23:59:18,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-10-21 23:59:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 722 transitions. [2020-10-21 23:59:18,934 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 722 transitions. Word has length 14 [2020-10-21 23:59:18,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:59:18,934 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 722 transitions. [2020-10-21 23:59:18,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:59:18,934 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 722 transitions. [2020-10-21 23:59:18,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 23:59:18,935 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:59:18,936 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:59:18,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:59:18,936 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:59:18,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:59:18,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1705881258, now seen corresponding path program 1 times [2020-10-21 23:59:18,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:59:18,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330193888] [2020-10-21 23:59:18,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:59:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:59:19,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:59:19,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330193888] [2020-10-21 23:59:19,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:59:19,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:59:19,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [239470073] [2020-10-21 23:59:19,237 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:59:19,246 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:59:19,258 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 40 transitions. [2020-10-21 23:59:19,258 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:59:19,455 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-21 23:59:19,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:59:19,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:59:19,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:59:19,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:59:19,456 INFO L87 Difference]: Start difference. First operand 304 states and 722 transitions. Second operand 6 states. [2020-10-21 23:59:19,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:59:19,523 INFO L93 Difference]: Finished difference Result 271 states and 654 transitions. [2020-10-21 23:59:19,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:59:19,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-21 23:59:19,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:59:19,526 INFO L225 Difference]: With dead ends: 271 [2020-10-21 23:59:19,526 INFO L226 Difference]: Without dead ends: 256 [2020-10-21 23:59:19,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:59:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-10-21 23:59:19,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2020-10-21 23:59:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-10-21 23:59:19,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 626 transitions. [2020-10-21 23:59:19,534 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 626 transitions. Word has length 20 [2020-10-21 23:59:19,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:59:19,535 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 626 transitions. [2020-10-21 23:59:19,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:59:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 626 transitions. [2020-10-21 23:59:19,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-21 23:59:19,536 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:59:19,536 INFO L422 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] [2020-10-21 23:59:19,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:59:19,537 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:59:19,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:59:19,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1879596139, now seen corresponding path program 1 times [2020-10-21 23:59:19,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:59:19,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154567999] [2020-10-21 23:59:19,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:59:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:59:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:59:19,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154567999] [2020-10-21 23:59:19,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:59:19,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:59:19,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1617958335] [2020-10-21 23:59:19,660 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:59:19,665 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:59:19,689 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 80 transitions. [2020-10-21 23:59:19,690 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:59:19,962 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-21 23:59:19,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:59:19,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:59:19,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:59:19,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:59:19,963 INFO L87 Difference]: Start difference. First operand 256 states and 626 transitions. Second operand 4 states. [2020-10-21 23:59:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:59:19,988 INFO L93 Difference]: Finished difference Result 379 states and 910 transitions. [2020-10-21 23:59:19,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:59:19,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-21 23:59:19,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:59:19,991 INFO L225 Difference]: With dead ends: 379 [2020-10-21 23:59:19,991 INFO L226 Difference]: Without dead ends: 176 [2020-10-21 23:59:19,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:59:19,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-21 23:59:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2020-10-21 23:59:19,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-21 23:59:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 396 transitions. [2020-10-21 23:59:19,998 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 396 transitions. Word has length 24 [2020-10-21 23:59:19,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:59:19,998 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 396 transitions. [2020-10-21 23:59:19,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:59:19,998 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 396 transitions. [2020-10-21 23:59:19,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-21 23:59:19,999 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:59:19,999 INFO L422 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] [2020-10-21 23:59:20,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:59:20,000 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:59:20,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:59:20,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1340291691, now seen corresponding path program 2 times [2020-10-21 23:59:20,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:59:20,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055945849] [2020-10-21 23:59:20,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:59:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:59:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:59:20,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055945849] [2020-10-21 23:59:20,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:59:20,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:59:20,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1331912970] [2020-10-21 23:59:20,239 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:59:20,244 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:59:20,280 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 134 transitions. [2020-10-21 23:59:20,280 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:59:20,459 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:20,461 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:20,462 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:20,467 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-21 23:59:20,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:20,470 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 23:59:20,470 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:59:20,472 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-10-21 23:59:20,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:20,473 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:20,478 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:20,482 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:20,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:20,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:59:20,496 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:59:20,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:59:20,501 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:20,507 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:59:20,508 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:20,512 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:20,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:20,519 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:20,523 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:20,527 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:20,532 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:20,535 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:59:20,536 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-21 23:59:20,537 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:20,539 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:20,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:20,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:59:20,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:20,552 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:20,616 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-21 23:59:20,618 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:20,621 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:20,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:20,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:59:20,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:20,633 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:20,642 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:20,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:20,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:20,648 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:20,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:20,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:20,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:20,662 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:20,668 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-21 23:59:20,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:20,893 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 30 [2020-10-21 23:59:21,018 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2020-10-21 23:59:21,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,031 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,044 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-21 23:59:21,044 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,046 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 3, 2, 1] term [2020-10-21 23:59:21,046 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:59:21,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:59:21,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:59:21,050 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,053 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,057 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-10-21 23:59:21,058 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-21 23:59:21,060 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,063 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,068 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-21 23:59:21,072 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:59:21,078 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,082 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-21 23:59:21,090 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:59:21,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,100 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,107 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-21 23:59:21,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,111 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-21 23:59:21,112 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,116 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,120 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:59:21,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,131 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-21 23:59:21,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,138 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:59:21,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:59:21,147 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:21,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,158 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:21,161 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,164 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:21,170 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-21 23:59:21,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,219 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,219 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,221 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,225 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-21 23:59:21,225 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,227 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 3, 3, 3, 2, 3, 2, 1] term [2020-10-21 23:59:21,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:59:21,228 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,231 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,234 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,238 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,239 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,249 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:59:21,249 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:59:21,251 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,252 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,256 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,261 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:21,262 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,268 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,268 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,274 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:21,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,287 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,292 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:21,293 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:59:21,300 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,300 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,302 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,307 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:21,312 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,315 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:21,327 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,328 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,329 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:21,345 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-21 23:59:21,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,691 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 39 [2020-10-21 23:59:21,903 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 105 [2020-10-21 23:59:21,917 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,927 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-21 23:59:21,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,931 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 3, 3, 3, 3, 3, 2, 1] term [2020-10-21 23:59:21,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:59:21,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,934 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,936 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:21,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,947 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:59:21,960 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,961 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,963 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:21,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,974 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,976 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:21,989 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:21,990 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:21,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,993 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:21,994 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:21,999 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:22,007 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:22,009 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:22,011 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:22,011 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:22,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:22,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:22,030 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-21 23:59:22,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:22,261 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2020-10-21 23:59:22,273 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:22,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:22,276 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-21 23:59:22,276 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:22,278 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 3, 2, 2, 1] term [2020-10-21 23:59:22,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:59:22,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:22,281 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:22,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:22,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:22,291 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:59:22,292 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-21 23:59:22,292 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:22,293 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:22,294 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:22,318 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:59:22,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:22,325 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:22,327 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:22,331 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-21 23:59:22,331 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:22,332 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:22,333 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:22,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:59:22,347 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:22,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:22,351 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:22,354 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-21 23:59:22,355 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:22,516 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 38 [2020-10-21 23:59:22,790 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2020-10-21 23:59:23,042 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 99 [2020-10-21 23:59:23,055 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:23,057 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:23,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:23,060 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-21 23:59:23,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:23,061 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 23:59:23,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:59:23,062 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:23,067 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:23,068 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:23,069 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:23,080 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:23,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:23,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:59:23,098 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-21 23:59:23,098 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-21 23:59:23,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:23,100 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:23,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:23,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:23,107 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:23,113 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-21 23:59:23,114 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:59:23,115 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:23,120 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:59:23,128 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:23,133 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:59:23,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:23,134 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:59:23,147 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-10-21 23:59:23,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:59:23,148 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-21 23:59:23,149 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-21 23:59:23,155 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:59:23,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:23,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:23,171 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:23,175 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:59:23,176 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-21 23:59:23,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:59:23,185 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:23,188 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:59:23,192 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:59:23,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:23,200 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-21 23:59:23,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:59:23,403 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 38 [2020-10-21 23:59:23,543 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2020-10-21 23:59:23,680 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2020-10-21 23:59:23,807 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2020-10-21 23:59:24,014 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2020-10-21 23:59:24,022 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [13800#(and (= ~z$w_buff0~0 1) (or (= (mod ~z$w_buff1_used~0 256) 0) (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd1~0 256) 0)))) (or (and (= ~z~0 1) (or (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))))) (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd1~0 256) 0))))), 13801#(and (or (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd2~0 256) 0))) (and (= ~z$w_buff0~0 1) (or (and (= ~z~0 1) (or (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))))) (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd1~0 256) 0)))))) (or (and (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$w_buff0~0 1)) (= (mod ~z$r_buff0_thd2~0 256) 0)) (or (= (mod ~z$w_buff1_used~0 256) 0) (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd1~0 256) 0)))))] [2020-10-21 23:59:24,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:59:24,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:59:24,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:59:24,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:59:24,023 INFO L87 Difference]: Start difference. First operand 176 states and 396 transitions. Second operand 10 states. [2020-10-21 23:59:24,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:59:24,333 INFO L93 Difference]: Finished difference Result 297 states and 643 transitions. [2020-10-21 23:59:24,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:59:24,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-21 23:59:24,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:59:24,336 INFO L225 Difference]: With dead ends: 297 [2020-10-21 23:59:24,336 INFO L226 Difference]: Without dead ends: 234 [2020-10-21 23:59:24,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:59:24,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-10-21 23:59:24,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 176. [2020-10-21 23:59:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-21 23:59:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 378 transitions. [2020-10-21 23:59:24,345 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 378 transitions. Word has length 24 [2020-10-21 23:59:24,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:59:24,345 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 378 transitions. [2020-10-21 23:59:24,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:59:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 378 transitions. [2020-10-21 23:59:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-21 23:59:24,346 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:59:24,347 INFO L422 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] [2020-10-21 23:59:24,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:59:24,347 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:59:24,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:59:24,347 INFO L82 PathProgramCache]: Analyzing trace with hash 393061549, now seen corresponding path program 3 times [2020-10-21 23:59:24,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:59:24,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696205920] [2020-10-21 23:59:24,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:59:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:59:24,474 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:59:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:59:24,568 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:59:24,628 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:59:24,628 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:59:24,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:59:24,671 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,672 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,672 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [746] [2020-10-21 23:59:24,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,678 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,678 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,682 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,686 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,687 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,687 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,687 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,687 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,688 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,688 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,689 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,689 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,689 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,690 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,691 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,691 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,691 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,691 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,691 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,691 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,692 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,692 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,694 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,694 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,694 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,695 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,695 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,695 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,695 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,695 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,695 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:59:24,695 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:59:24,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:59:24 BasicIcfg [2020-10-21 23:59:24,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:59:24,833 INFO L168 Benchmark]: Toolchain (without parser) took 14549.94 ms. Allocated memory was 146.3 MB in the beginning and 409.5 MB in the end (delta: 263.2 MB). Free memory was 101.0 MB in the beginning and 342.0 MB in the end (delta: -241.0 MB). Peak memory consumption was 254.8 MB. Max. memory is 7.1 GB. [2020-10-21 23:59:24,833 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.3 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-21 23:59:24,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.68 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.1 MB in the beginning and 154.3 MB in the end (delta: -54.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2020-10-21 23:59:24,835 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.22 ms. Allocated memory is still 203.9 MB. Free memory was 154.3 MB in the beginning and 151.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:59:24,836 INFO L168 Benchmark]: Boogie Preprocessor took 63.89 ms. Allocated memory is still 203.9 MB. Free memory was 151.5 MB in the beginning and 148.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:59:24,836 INFO L168 Benchmark]: RCFGBuilder took 2183.76 ms. Allocated memory was 203.9 MB in the beginning and 247.5 MB in the end (delta: 43.5 MB). Free memory was 148.8 MB in the beginning and 158.3 MB in the end (delta: -9.5 MB). Peak memory consumption was 100.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:59:24,837 INFO L168 Benchmark]: TraceAbstraction took 11364.96 ms. Allocated memory was 247.5 MB in the beginning and 409.5 MB in the end (delta: 162.0 MB). Free memory was 156.5 MB in the beginning and 342.0 MB in the end (delta: -185.5 MB). Peak memory consumption was 209.2 MB. Max. memory is 7.1 GB. [2020-10-21 23:59:24,841 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 146.3 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 845.68 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.1 MB in the beginning and 154.3 MB in the end (delta: -54.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.22 ms. Allocated memory is still 203.9 MB. Free memory was 154.3 MB in the beginning and 151.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.89 ms. Allocated memory is still 203.9 MB. Free memory was 151.5 MB in the beginning and 148.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2183.76 ms. Allocated memory was 203.9 MB in the beginning and 247.5 MB in the end (delta: 43.5 MB). Free memory was 148.8 MB in the beginning and 158.3 MB in the end (delta: -9.5 MB). Peak memory consumption was 100.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11364.96 ms. Allocated memory was 247.5 MB in the beginning and 409.5 MB in the end (delta: 162.0 MB). Free memory was 156.5 MB in the beginning and 342.0 MB in the end (delta: -185.5 MB). Peak memory consumption was 209.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1077 VarBasedMoverChecksPositive, 31 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 88 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.2s, 113 PlacesBefore, 39 PlacesAfterwards, 106 TransitionsBefore, 30 TransitionsAfterwards, 2064 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 6466 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t153; [L844] FCALL, FORK 0 pthread_create(&t153, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L845] 0 pthread_t t154; [L846] FCALL, FORK 0 pthread_create(&t154, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=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] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L18] COND TRUE 1 !expression [L17] COND FALSE 1 !(0) [L17] 1 __assert_fail ("0", "mix006_power.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=0, 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] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=2, 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] [L779] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=2, 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] [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=2, 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] [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L785] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L787] 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 [L788] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L789] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L789] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L847] 0 pthread_t t155; [L848] FCALL, FORK 0 pthread_create(&t155, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=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] [L799] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __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=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] [L802] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __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=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] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 z$flush_delayed = weak$$choice2 [L808] 3 z$mem_tmp = z [L809] 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) [L809] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L809] 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) [L809] 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) [L810] EXPR 3 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)) [L810] EXPR 3 !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) [L810] EXPR 3 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)) [L810] 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)) [L811] EXPR 3 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)) [L811] 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)) [L812] EXPR 3 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)) [L812] EXPR 3 !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) [L812] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L812] EXPR 3 !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) [L812] EXPR 3 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)) [L812] 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)) [L813] 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)) [L813] EXPR 3 !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) [L813] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L813] EXPR 3 !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) [L813] 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)) [L813] 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)) [L814] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L814] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L814] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L814] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L815] 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)) [L815] 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)) [L816] 3 __unbuffered_p2_EBX = z [L817] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L817] 3 z = z$flush_delayed ? z$mem_tmp : z [L818] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __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=50, 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] [L762] 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) [L762] 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) [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L764] 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 [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L821] 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) [L821] 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) [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L823] 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 [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L854] 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) [L854] 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) [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L856] 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 [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix006_power.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __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=50, weak$$choice2=0, x=2, y=1, z=1, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 104 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.0s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 235 SDtfs, 252 SDslu, 552 SDs, 0 SdLazy, 192 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 9 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1382occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 58 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 9858 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...