/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/safe010_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 00:34:22,083 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 00:34:22,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 00:34:22,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 00:34:22,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 00:34:22,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 00:34:22,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 00:34:22,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 00:34:22,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 00:34:22,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 00:34:22,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 00:34:22,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 00:34:22,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 00:34:22,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 00:34:22,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 00:34:22,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 00:34:22,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 00:34:22,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 00:34:22,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 00:34:22,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 00:34:22,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 00:34:22,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 00:34:22,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 00:34:22,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 00:34:22,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 00:34:22,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 00:34:22,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 00:34:22,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 00:34:22,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 00:34:22,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 00:34:22,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 00:34:22,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 00:34:22,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 00:34:22,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 00:34:22,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 00:34:22,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 00:34:22,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 00:34:22,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 00:34:22,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 00:34:22,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 00:34:22,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 00:34:22,145 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-22 00:34:22,173 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 00:34:22,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 00:34:22,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 00:34:22,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 00:34:22,175 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 00:34:22,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 00:34:22,175 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 00:34:22,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 00:34:22,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 00:34:22,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 00:34:22,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 00:34:22,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 00:34:22,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 00:34:22,176 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 00:34:22,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 00:34:22,177 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 00:34:22,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 00:34:22,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 00:34:22,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 00:34:22,177 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 00:34:22,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 00:34:22,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:34:22,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 00:34:22,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 00:34:22,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 00:34:22,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 00:34:22,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 00:34:22,179 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 00:34:22,179 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 00:34:22,179 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 00:34:22,180 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 00:34:22,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 00:34:22,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 00:34:22,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 00:34:22,564 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 00:34:22,566 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 00:34:22,568 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2020-10-22 00:34:22,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f079ec2ec/847dbf0a621f430591a99a529a891cea/FLAGae1726a60 [2020-10-22 00:34:23,224 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 00:34:23,225 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2020-10-22 00:34:23,240 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f079ec2ec/847dbf0a621f430591a99a529a891cea/FLAGae1726a60 [2020-10-22 00:34:23,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f079ec2ec/847dbf0a621f430591a99a529a891cea [2020-10-22 00:34:23,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 00:34:23,533 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 00:34:23,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 00:34:23,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 00:34:23,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 00:34:23,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:34:23" (1/1) ... [2020-10-22 00:34:23,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@223ab37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:23, skipping insertion in model container [2020-10-22 00:34:23,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:34:23" (1/1) ... [2020-10-22 00:34:23,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 00:34:23,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 00:34:24,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:34:24,228 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 00:34:24,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:34:24,383 INFO L208 MainTranslator]: Completed translation [2020-10-22 00:34:24,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:24 WrapperNode [2020-10-22 00:34:24,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 00:34:24,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 00:34:24,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 00:34:24,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 00:34:24,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:24" (1/1) ... [2020-10-22 00:34:24,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:24" (1/1) ... [2020-10-22 00:34:24,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 00:34:24,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 00:34:24,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 00:34:24,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 00:34:24,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:24" (1/1) ... [2020-10-22 00:34:24,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:24" (1/1) ... [2020-10-22 00:34:24,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:24" (1/1) ... [2020-10-22 00:34:24,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:24" (1/1) ... [2020-10-22 00:34:24,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:24" (1/1) ... [2020-10-22 00:34:24,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:24" (1/1) ... [2020-10-22 00:34:24,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:24" (1/1) ... [2020-10-22 00:34:24,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 00:34:24,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 00:34:24,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 00:34:24,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 00:34:24,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:24" (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-22 00:34:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 00:34:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 00:34:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 00:34:24,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 00:34:24,569 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 00:34:24,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 00:34:24,570 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 00:34:24,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 00:34:24,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 00:34:24,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 00:34:24,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 00:34:24,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 00:34:24,575 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 00:34:26,680 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 00:34:26,680 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 00:34:26,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:34:26 BoogieIcfgContainer [2020-10-22 00:34:26,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 00:34:26,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 00:34:26,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 00:34:26,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 00:34:26,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 12:34:23" (1/3) ... [2020-10-22 00:34:26,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421a6a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:34:26, skipping insertion in model container [2020-10-22 00:34:26,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:24" (2/3) ... [2020-10-22 00:34:26,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421a6a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:34:26, skipping insertion in model container [2020-10-22 00:34:26,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:34:26" (3/3) ... [2020-10-22 00:34:26,693 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_rmo.oepc.i [2020-10-22 00:34:26,710 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 00:34:26,710 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 00:34:26,719 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 00:34:26,720 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 00:34:26,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,754 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,754 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,755 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,757 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,761 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,762 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,770 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,771 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,772 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,774 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,775 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,775 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,775 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,775 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,776 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,776 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,776 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,777 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:26,778 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:34:26,798 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-22 00:34:26,826 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:34:26,827 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:34:26,827 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:34:26,827 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:34:26,827 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:34:26,828 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:34:26,828 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:34:26,828 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:34:26,844 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:34:26,845 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 84 transitions, 178 flow [2020-10-22 00:34:26,850 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 84 transitions, 178 flow [2020-10-22 00:34:26,853 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 88 places, 84 transitions, 178 flow [2020-10-22 00:34:26,904 INFO L129 PetriNetUnfolder]: 3/82 cut-off events. [2020-10-22 00:34:26,905 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 00:34:26,910 INFO L80 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 3/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2020-10-22 00:34:26,913 INFO L116 LiptonReduction]: Number of co-enabled transitions 1046 [2020-10-22 00:34:27,564 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-22 00:34:28,096 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-22 00:34:30,015 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 236 DAG size of output: 196 [2020-10-22 00:34:30,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-22 00:34:30,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:34:30,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-22 00:34:30,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:34:31,052 WARN L193 SmtUtils]: Spent 976.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 122 [2020-10-22 00:34:32,473 WARN L193 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 227 DAG size of output: 187 [2020-10-22 00:34:32,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-22 00:34:32,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:34:32,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-22 00:34:32,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:34:33,866 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 142 DAG size of output: 107 [2020-10-22 00:34:34,258 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-22 00:34:34,585 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-22 00:34:35,123 WARN L193 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2020-10-22 00:34:35,294 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-22 00:34:35,299 INFO L131 LiptonReduction]: Checked pairs total: 2714 [2020-10-22 00:34:35,300 INFO L133 LiptonReduction]: Total number of compositions: 81 [2020-10-22 00:34:35,306 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-10-22 00:34:35,324 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 164 states. [2020-10-22 00:34:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2020-10-22 00:34:35,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-22 00:34:35,332 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:35,333 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-22 00:34:35,334 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:35,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:35,340 INFO L82 PathProgramCache]: Analyzing trace with hash 949666, now seen corresponding path program 1 times [2020-10-22 00:34:35,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:35,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463433891] [2020-10-22 00:34:35,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:35,637 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-22 00:34:35,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463433891] [2020-10-22 00:34:35,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:35,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:34:35,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [993079030] [2020-10-22 00:34:35,640 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:35,643 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:35,655 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-22 00:34:35,655 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:35,659 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:34:35,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:34:35,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:35,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:34:35,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:34:35,677 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 3 states. [2020-10-22 00:34:35,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:35,737 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-22 00:34:35,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:34:35,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-22 00:34:35,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:35,750 INFO L225 Difference]: With dead ends: 137 [2020-10-22 00:34:35,751 INFO L226 Difference]: Without dead ends: 112 [2020-10-22 00:34:35,752 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-22 00:34:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-22 00:34:35,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-22 00:34:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-22 00:34:35,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-22 00:34:35,801 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 3 [2020-10-22 00:34:35,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:35,801 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-22 00:34:35,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:34:35,802 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-22 00:34:35,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-22 00:34:35,802 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:35,802 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:35,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 00:34:35,803 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:35,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:35,804 INFO L82 PathProgramCache]: Analyzing trace with hash 904100816, now seen corresponding path program 1 times [2020-10-22 00:34:35,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:35,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031087498] [2020-10-22 00:34:35,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:35,911 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-22 00:34:35,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031087498] [2020-10-22 00:34:35,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:35,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:34:35,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [18663522] [2020-10-22 00:34:35,912 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:35,914 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:35,916 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-22 00:34:35,916 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:35,917 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:34:35,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:34:35,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:35,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:34:35,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:34:35,919 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-10-22 00:34:35,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:35,945 INFO L93 Difference]: Finished difference Result 107 states and 241 transitions. [2020-10-22 00:34:35,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:34:35,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-22 00:34:35,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:35,950 INFO L225 Difference]: With dead ends: 107 [2020-10-22 00:34:35,950 INFO L226 Difference]: Without dead ends: 107 [2020-10-22 00:34:35,951 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-22 00:34:35,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-22 00:34:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-22 00:34:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-22 00:34:35,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 241 transitions. [2020-10-22 00:34:35,975 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 241 transitions. Word has length 7 [2020-10-22 00:34:35,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:35,976 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 241 transitions. [2020-10-22 00:34:35,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:34:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 241 transitions. [2020-10-22 00:34:35,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-22 00:34:35,977 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:35,977 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:35,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 00:34:35,977 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:35,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:35,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2037646372, now seen corresponding path program 1 times [2020-10-22 00:34:35,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:35,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276312607] [2020-10-22 00:34:35,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:36,137 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-22 00:34:36,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276312607] [2020-10-22 00:34:36,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:36,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:34:36,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1866905389] [2020-10-22 00:34:36,139 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:36,140 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:36,143 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 12 transitions. [2020-10-22 00:34:36,143 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:36,170 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:36,196 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:36,198 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:36,223 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:34:36,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:36,376 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1112#(and (or (and (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff0_used~0 256) 0))) (and (< 0 (+ (div ~y$w_buff0_used~0 256) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))) (= ~__unbuffered_p1_EAX~0 0))] [2020-10-22 00:34:36,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:34:36,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:36,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:34:36,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:34:36,377 INFO L87 Difference]: Start difference. First operand 107 states and 241 transitions. Second operand 6 states. [2020-10-22 00:34:36,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:36,488 INFO L93 Difference]: Finished difference Result 103 states and 230 transitions. [2020-10-22 00:34:36,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:34:36,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-10-22 00:34:36,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:36,491 INFO L225 Difference]: With dead ends: 103 [2020-10-22 00:34:36,491 INFO L226 Difference]: Without dead ends: 103 [2020-10-22 00:34:36,492 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:34:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-22 00:34:36,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-10-22 00:34:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-22 00:34:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 230 transitions. [2020-10-22 00:34:36,501 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 230 transitions. Word has length 8 [2020-10-22 00:34:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:36,502 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 230 transitions. [2020-10-22 00:34:36,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:34:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 230 transitions. [2020-10-22 00:34:36,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 00:34:36,503 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:36,503 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:36,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 00:34:36,504 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:36,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:36,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1237729489, now seen corresponding path program 1 times [2020-10-22 00:34:36,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:36,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713590589] [2020-10-22 00:34:36,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:36,656 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-22 00:34:36,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713590589] [2020-10-22 00:34:36,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:36,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:34:36,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1026041100] [2020-10-22 00:34:36,657 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:36,658 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:36,663 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 24 transitions. [2020-10-22 00:34:36,664 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:36,684 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 1] term [2020-10-22 00:34:36,684 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:36,686 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-22 00:34:36,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:36,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:36,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:36,705 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:36,712 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:36,723 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:36,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:36,980 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1430#(and (= (mod ~y$r_buff0_thd0~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (not (= 2 ~y~0)) (= ~__unbuffered_p1_EAX~0 0)), 1431#(and (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~y~0)) (= ~__unbuffered_p1_EAX~0 0))] [2020-10-22 00:34:36,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 00:34:36,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:36,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 00:34:36,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:34:36,981 INFO L87 Difference]: Start difference. First operand 103 states and 230 transitions. Second operand 8 states. [2020-10-22 00:34:37,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:37,110 INFO L93 Difference]: Finished difference Result 107 states and 240 transitions. [2020-10-22 00:34:37,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:34:37,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2020-10-22 00:34:37,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:37,115 INFO L225 Difference]: With dead ends: 107 [2020-10-22 00:34:37,115 INFO L226 Difference]: Without dead ends: 107 [2020-10-22 00:34:37,115 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:34:37,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-22 00:34:37,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-22 00:34:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-22 00:34:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 240 transitions. [2020-10-22 00:34:37,127 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 240 transitions. Word has length 9 [2020-10-22 00:34:37,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:37,127 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 240 transitions. [2020-10-22 00:34:37,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 00:34:37,128 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 240 transitions. [2020-10-22 00:34:37,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 00:34:37,129 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:37,129 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:37,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 00:34:37,129 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:37,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:37,130 INFO L82 PathProgramCache]: Analyzing trace with hash -349162932, now seen corresponding path program 1 times [2020-10-22 00:34:37,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:37,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667637196] [2020-10-22 00:34:37,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:37,250 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-22 00:34:37,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667637196] [2020-10-22 00:34:37,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:37,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:34:37,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [499179901] [2020-10-22 00:34:37,251 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:37,253 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:37,256 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 28 transitions. [2020-10-22 00:34:37,256 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:37,416 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 00:34:37,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:37,418 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:34:37,418 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:37,420 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:37,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:37,432 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:37,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:37,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:37,454 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:37,464 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:37,514 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:34:37,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:34:37,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:37,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:34:37,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:34:37,515 INFO L87 Difference]: Start difference. First operand 107 states and 240 transitions. Second operand 5 states. [2020-10-22 00:34:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:37,615 INFO L93 Difference]: Finished difference Result 106 states and 237 transitions. [2020-10-22 00:34:37,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:34:37,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-22 00:34:37,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:37,617 INFO L225 Difference]: With dead ends: 106 [2020-10-22 00:34:37,617 INFO L226 Difference]: Without dead ends: 106 [2020-10-22 00:34:37,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:34:37,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-22 00:34:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-10-22 00:34:37,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-22 00:34:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 237 transitions. [2020-10-22 00:34:37,626 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 237 transitions. Word has length 10 [2020-10-22 00:34:37,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:37,626 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 237 transitions. [2020-10-22 00:34:37,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:34:37,626 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 237 transitions. [2020-10-22 00:34:37,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:34:37,627 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:37,628 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:37,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 00:34:37,628 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:37,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:37,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1997703090, now seen corresponding path program 1 times [2020-10-22 00:34:37,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:37,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647733504] [2020-10-22 00:34:37,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:37,724 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-22 00:34:37,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647733504] [2020-10-22 00:34:37,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:37,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:34:37,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [259119247] [2020-10-22 00:34:37,726 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:37,728 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:37,733 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 38 transitions. [2020-10-22 00:34:37,733 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:37,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:38,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:38,039 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2084#(not (= 2 ~__unbuffered_cnt~0))] [2020-10-22 00:34:38,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:34:38,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:38,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:34:38,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:34:38,041 INFO L87 Difference]: Start difference. First operand 106 states and 237 transitions. Second operand 5 states. [2020-10-22 00:34:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:38,098 INFO L93 Difference]: Finished difference Result 69 states and 137 transitions. [2020-10-22 00:34:38,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:34:38,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-22 00:34:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:38,100 INFO L225 Difference]: With dead ends: 69 [2020-10-22 00:34:38,100 INFO L226 Difference]: Without dead ends: 42 [2020-10-22 00:34:38,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:34:38,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-10-22 00:34:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-10-22 00:34:38,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-22 00:34:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. [2020-10-22 00:34:38,104 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 63 transitions. Word has length 11 [2020-10-22 00:34:38,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:38,105 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 63 transitions. [2020-10-22 00:34:38,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:34:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 63 transitions. [2020-10-22 00:34:38,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:34:38,106 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:38,106 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:38,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 00:34:38,106 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:38,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:38,107 INFO L82 PathProgramCache]: Analyzing trace with hash 25656177, now seen corresponding path program 1 times [2020-10-22 00:34:38,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:38,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413670623] [2020-10-22 00:34:38,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:38,392 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-22 00:34:38,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413670623] [2020-10-22 00:34:38,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:38,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 00:34:38,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1424126296] [2020-10-22 00:34:38,393 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:38,396 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:38,403 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 29 transitions. [2020-10-22 00:34:38,403 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:38,691 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2020-10-22 00:34:38,729 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:34:38,730 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:38,731 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:38,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:38,737 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:38,744 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:38,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:38,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:38,766 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:34:38,769 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 00:34:38,770 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:34:38,805 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:34:38,805 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:38,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:38,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:38,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:38,821 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:38,828 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:38,828 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:38,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:38,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:38,856 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:38,857 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:38,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:38,865 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:38,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:38,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:38,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:38,889 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:34:38,895 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 00:34:38,898 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:34:39,031 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2020-10-22 00:34:39,095 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2246#(and (= ~y$r_buff1_thd0~0 0) (or (and (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0)) (and (not (= (mod ~y$r_buff0_thd1~0 256) 0)) (not (= (mod ~y$w_buff0_used~0 256) 0)))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0))] [2020-10-22 00:34:39,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:34:39,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:39,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:34:39,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:34:39,098 INFO L87 Difference]: Start difference. First operand 40 states and 63 transitions. Second operand 9 states. [2020-10-22 00:34:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:39,366 INFO L93 Difference]: Finished difference Result 52 states and 78 transitions. [2020-10-22 00:34:39,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-22 00:34:39,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-22 00:34:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:39,369 INFO L225 Difference]: With dead ends: 52 [2020-10-22 00:34:39,369 INFO L226 Difference]: Without dead ends: 36 [2020-10-22 00:34:39,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-10-22 00:34:39,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-10-22 00:34:39,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2020-10-22 00:34:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-22 00:34:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2020-10-22 00:34:39,374 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 15 [2020-10-22 00:34:39,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:39,375 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2020-10-22 00:34:39,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:34:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2020-10-22 00:34:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:34:39,375 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:39,376 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:39,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 00:34:39,376 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:39,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:39,376 INFO L82 PathProgramCache]: Analyzing trace with hash 585857653, now seen corresponding path program 2 times [2020-10-22 00:34:39,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:39,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803434366] [2020-10-22 00:34:39,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:34:39,425 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:34:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:34:39,468 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:34:39,516 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:34:39,517 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:34:39,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 00:34:39,518 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 00:34:39,529 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L799-->L806: Formula: (let ((.cse7 (= (mod ~y$r_buff0_thd0~0_In-513841483 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In-513841483 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In-513841483 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In-513841483 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (or (and .cse0 (= ~y$w_buff1_used~0_Out-513841483 ~y$w_buff1_used~0_In-513841483)) (and .cse1 .cse2 (= ~y$w_buff1_used~0_Out-513841483 0))) (= ~y$r_buff1_thd0~0_Out-513841483 ~y$r_buff1_thd0~0_In-513841483) (or (and (or (and .cse1 .cse2 (= ~y~0_Out-513841483 ~y$w_buff1~0_In-513841483)) (and .cse0 (= ~y~0_Out-513841483 ~y~0_In-513841483))) .cse3) (and .cse4 (= ~y~0_Out-513841483 ~y$w_buff0~0_In-513841483) .cse5)) (= ~y$r_buff0_thd0~0_In-513841483 ~y$r_buff0_thd0~0_Out-513841483) (not (= 0 ULTIMATE.start_assume_abort_if_not_~cond_Out-513841483)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-513841483 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-513841483|) (or (and .cse4 (= ~y$w_buff0_used~0_Out-513841483 0) .cse5) (and (= ~y$w_buff0_used~0_Out-513841483 ~y$w_buff0_used~0_In-513841483) .cse3))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-513841483|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-513841483, ~y$w_buff1~0=~y$w_buff1~0_In-513841483, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-513841483, ~y$w_buff0~0=~y$w_buff0~0_In-513841483, ~y~0=~y~0_In-513841483, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-513841483, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-513841483} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-513841483, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-513841483|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-513841483|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-513841483|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-513841483|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-513841483|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-513841483|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-513841483|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-513841483, ~y$w_buff1~0=~y$w_buff1~0_In-513841483, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-513841483, ~y$w_buff0~0=~y$w_buff0~0_In-513841483, ~y~0=~y~0_Out-513841483, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-513841483, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-513841483} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-22 00:34:39,536 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-22 00:34:39,536 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [735] [2020-10-22 00:34:39,541 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-22 00:34:39,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,541 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-22 00:34:39,544 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,545 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-22 00:34:39,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,545 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-22 00:34:39,548 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,548 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-22 00:34:39,548 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,550 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-22 00:34:39,550 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,550 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-22 00:34:39,550 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,551 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-22 00:34:39,551 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,551 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-22 00:34:39,551 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,551 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-22 00:34:39,551 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,552 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-22 00:34:39,552 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,554 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-22 00:34:39,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,554 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-22 00:34:39,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,554 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-22 00:34:39,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,555 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-22 00:34:39,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,555 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-22 00:34:39,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,555 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-22 00:34:39,556 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,556 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-22 00:34:39,556 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,560 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-22 00:34:39,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,561 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-22 00:34:39,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,561 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-22 00:34:39,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,561 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-22 00:34:39,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,562 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-22 00:34:39,562 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:39,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 12:34:39 BasicIcfg [2020-10-22 00:34:39,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 00:34:39,618 INFO L168 Benchmark]: Toolchain (without parser) took 16090.59 ms. Allocated memory was 138.4 MB in the beginning and 379.6 MB in the end (delta: 241.2 MB). Free memory was 99.7 MB in the beginning and 123.9 MB in the end (delta: -24.2 MB). Peak memory consumption was 217.0 MB. Max. memory is 7.1 GB. [2020-10-22 00:34:39,621 INFO L168 Benchmark]: CDTParser took 3.55 ms. Allocated memory is still 138.4 MB. Free memory was 120.0 MB in the beginning and 119.5 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-10-22 00:34:39,623 INFO L168 Benchmark]: CACSL2BoogieTranslator took 849.80 ms. Allocated memory was 138.4 MB in the beginning and 199.2 MB in the end (delta: 60.8 MB). Free memory was 98.4 MB in the beginning and 151.4 MB in the end (delta: -53.0 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2020-10-22 00:34:39,623 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.66 ms. Allocated memory is still 199.2 MB. Free memory was 151.4 MB in the beginning and 148.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-22 00:34:39,624 INFO L168 Benchmark]: Boogie Preprocessor took 47.53 ms. Allocated memory is still 199.2 MB. Free memory was 148.5 MB in the beginning and 146.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-22 00:34:39,625 INFO L168 Benchmark]: RCFGBuilder took 2177.16 ms. Allocated memory was 199.2 MB in the beginning and 252.7 MB in the end (delta: 53.5 MB). Free memory was 146.5 MB in the beginning and 202.0 MB in the end (delta: -55.5 MB). Peak memory consumption was 103.9 MB. Max. memory is 7.1 GB. [2020-10-22 00:34:39,626 INFO L168 Benchmark]: TraceAbstraction took 12932.01 ms. Allocated memory was 252.7 MB in the beginning and 379.6 MB in the end (delta: 126.9 MB). Free memory was 202.0 MB in the beginning and 123.9 MB in the end (delta: 78.2 MB). Peak memory consumption was 205.0 MB. Max. memory is 7.1 GB. [2020-10-22 00:34:39,630 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.55 ms. Allocated memory is still 138.4 MB. Free memory was 120.0 MB in the beginning and 119.5 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 849.80 ms. Allocated memory was 138.4 MB in the beginning and 199.2 MB in the end (delta: 60.8 MB). Free memory was 98.4 MB in the beginning and 151.4 MB in the end (delta: -53.0 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.66 ms. Allocated memory is still 199.2 MB. Free memory was 151.4 MB in the beginning and 148.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.53 ms. Allocated memory is still 199.2 MB. Free memory was 148.5 MB in the beginning and 146.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2177.16 ms. Allocated memory was 199.2 MB in the beginning and 252.7 MB in the end (delta: 53.5 MB). Free memory was 146.5 MB in the beginning and 202.0 MB in the end (delta: -55.5 MB). Peak memory consumption was 103.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12932.01 ms. Allocated memory was 252.7 MB in the beginning and 379.6 MB in the end (delta: 126.9 MB). Free memory was 202.0 MB in the beginning and 123.9 MB in the end (delta: 78.2 MB). Peak memory consumption was 205.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 553 VarBasedMoverChecksPositive, 28 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 35 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.4s, 88 PlacesBefore, 26 PlacesAfterwards, 84 TransitionsBefore, 19 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 81 TotalNumberOfCompositions, 2714 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2017; [L793] FCALL, FORK 0 pthread_create(&t2017, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2018; [L795] FCALL, FORK 0 pthread_create(&t2018, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe010_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 82 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.6s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.4s, HoareTripleCheckerStatistics: 93 SDtfs, 109 SDslu, 171 SDs, 0 SdLazy, 152 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred 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.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 56 ConstructedInterpolants, 0 QuantifiedInterpolants, 6284 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...