/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-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 02:19:18,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 02:19:18,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 02:19:18,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 02:19:18,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 02:19:18,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 02:19:18,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 02:19:18,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 02:19:18,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 02:19:18,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 02:19:18,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 02:19:18,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 02:19:18,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 02:19:18,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 02:19:18,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 02:19:18,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 02:19:18,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 02:19:18,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 02:19:18,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 02:19:18,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 02:19:18,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 02:19:18,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 02:19:18,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 02:19:18,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 02:19:18,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 02:19:18,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 02:19:18,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 02:19:18,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 02:19:18,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 02:19:18,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 02:19:18,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 02:19:18,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 02:19:18,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 02:19:18,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 02:19:18,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 02:19:18,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 02:19:18,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 02:19:18,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 02:19:18,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 02:19:18,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 02:19:18,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 02:19:18,223 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-SP.epf [2020-10-22 02:19:18,246 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 02:19:18,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 02:19:18,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 02:19:18,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 02:19:18,248 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 02:19:18,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 02:19:18,248 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 02:19:18,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 02:19:18,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 02:19:18,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 02:19:18,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 02:19:18,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 02:19:18,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 02:19:18,249 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 02:19:18,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 02:19:18,250 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 02:19:18,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 02:19:18,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 02:19:18,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 02:19:18,251 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 02:19:18,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 02:19:18,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:19:18,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 02:19:18,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 02:19:18,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 02:19:18,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 02:19:18,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 02:19:18,252 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 02:19:18,252 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 02:19:18,253 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 02:19:18,253 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 02:19:18,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 02:19:18,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 02:19:18,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 02:19:18,616 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 02:19:18,617 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 02:19:18,617 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2020-10-22 02:19:18,679 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e2e7f8a/14e6527ad805413a8a339182069b56e5/FLAG5502318ee [2020-10-22 02:19:19,176 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 02:19:19,177 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2020-10-22 02:19:19,198 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e2e7f8a/14e6527ad805413a8a339182069b56e5/FLAG5502318ee [2020-10-22 02:19:19,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e2e7f8a/14e6527ad805413a8a339182069b56e5 [2020-10-22 02:19:19,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 02:19:19,489 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 02:19:19,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 02:19:19,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 02:19:19,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 02:19:19,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:19:19" (1/1) ... [2020-10-22 02:19:19,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d90208e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:19, skipping insertion in model container [2020-10-22 02:19:19,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:19:19" (1/1) ... [2020-10-22 02:19:19,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 02:19:19,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 02:19:20,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:19:20,213 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 02:19:20,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:19:20,358 INFO L208 MainTranslator]: Completed translation [2020-10-22 02:19:20,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:20 WrapperNode [2020-10-22 02:19:20,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 02:19:20,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 02:19:20,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 02:19:20,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 02:19:20,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:20" (1/1) ... [2020-10-22 02:19:20,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:20" (1/1) ... [2020-10-22 02:19:20,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 02:19:20,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 02:19:20,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 02:19:20,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 02:19:20,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:20" (1/1) ... [2020-10-22 02:19:20,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:20" (1/1) ... [2020-10-22 02:19:20,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:20" (1/1) ... [2020-10-22 02:19:20,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:20" (1/1) ... [2020-10-22 02:19:20,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:20" (1/1) ... [2020-10-22 02:19:20,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:20" (1/1) ... [2020-10-22 02:19:20,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:20" (1/1) ... [2020-10-22 02:19:20,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 02:19:20,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 02:19:20,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 02:19:20,499 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 02:19:20,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:20" (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 02:19:20,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 02:19:20,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 02:19:20,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 02:19:20,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 02:19:20,579 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 02:19:20,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 02:19:20,579 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 02:19:20,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 02:19:20,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 02:19:20,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 02:19:20,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 02:19:20,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 02:19:20,583 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 02:19:22,587 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 02:19:22,587 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 02:19:22,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:19:22 BoogieIcfgContainer [2020-10-22 02:19:22,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 02:19:22,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 02:19:22,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 02:19:22,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 02:19:22,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 02:19:19" (1/3) ... [2020-10-22 02:19:22,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cd1e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:19:22, skipping insertion in model container [2020-10-22 02:19:22,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:20" (2/3) ... [2020-10-22 02:19:22,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cd1e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:19:22, skipping insertion in model container [2020-10-22 02:19:22,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:19:22" (3/3) ... [2020-10-22 02:19:22,600 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc.i [2020-10-22 02:19:22,613 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 02:19:22,614 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 02:19:22,622 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 02:19:22,623 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 02:19:22,651 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,652 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,652 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,653 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,654 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,657 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,657 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,664 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,666 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,667 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,671 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,671 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:22,674 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 02:19:22,688 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-22 02:19:22,710 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 02:19:22,711 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 02:19:22,711 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 02:19:22,711 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 02:19:22,711 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 02:19:22,711 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 02:19:22,712 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 02:19:22,712 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 02:19:22,725 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 02:19:22,726 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 83 transitions, 176 flow [2020-10-22 02:19:22,729 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 83 transitions, 176 flow [2020-10-22 02:19:22,731 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 176 flow [2020-10-22 02:19:22,775 INFO L129 PetriNetUnfolder]: 3/81 cut-off events. [2020-10-22 02:19:22,775 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 02:19:22,780 INFO L80 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 3/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2020-10-22 02:19:22,783 INFO L116 LiptonReduction]: Number of co-enabled transitions 1046 [2020-10-22 02:19:23,647 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-22 02:19:25,861 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 227 DAG size of output: 187 [2020-10-22 02:19:25,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-22 02:19:25,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:19:25,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-22 02:19:25,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:19:26,582 WARN L193 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 105 [2020-10-22 02:19:27,786 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 235 DAG size of output: 195 [2020-10-22 02:19:27,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-22 02:19:27,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:19:27,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-22 02:19:27,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:19:28,879 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 150 DAG size of output: 121 [2020-10-22 02:19:29,945 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 227 DAG size of output: 187 [2020-10-22 02:19:29,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-22 02:19:29,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:19:29,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-22 02:19:29,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:19:30,653 WARN L193 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 105 [2020-10-22 02:19:31,090 WARN L193 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-22 02:19:31,440 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-22 02:19:31,929 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-22 02:19:32,298 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-22 02:19:32,642 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2020-10-22 02:19:32,816 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-22 02:19:32,834 INFO L131 LiptonReduction]: Checked pairs total: 2660 [2020-10-22 02:19:32,834 INFO L133 LiptonReduction]: Total number of compositions: 83 [2020-10-22 02:19:32,841 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-10-22 02:19:32,860 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 164 states. [2020-10-22 02:19:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2020-10-22 02:19:32,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-22 02:19:32,869 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:19:32,870 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-22 02:19:32,870 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:19:32,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:19:32,876 INFO L82 PathProgramCache]: Analyzing trace with hash 948624, now seen corresponding path program 1 times [2020-10-22 02:19:32,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:19:32,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196891388] [2020-10-22 02:19:32,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:19:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:19:33,233 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 02:19:33,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196891388] [2020-10-22 02:19:33,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:19:33,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:19:33,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [531120659] [2020-10-22 02:19:33,237 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:19:33,240 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:19:33,253 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-22 02:19:33,254 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:19:33,258 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:19:33,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:19:33,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:19:33,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:19:33,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:19:33,280 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 3 states. [2020-10-22 02:19:33,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:19:33,356 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-22 02:19:33,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:19:33,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-22 02:19:33,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:19:33,371 INFO L225 Difference]: With dead ends: 137 [2020-10-22 02:19:33,371 INFO L226 Difference]: Without dead ends: 112 [2020-10-22 02:19:33,372 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 02:19:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-22 02:19:33,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-22 02:19:33,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-22 02:19:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-22 02:19:33,427 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 3 [2020-10-22 02:19:33,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:19:33,428 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-22 02:19:33,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:19:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-22 02:19:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-22 02:19:33,429 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:19:33,429 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:19:33,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 02:19:33,430 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:19:33,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:19:33,430 INFO L82 PathProgramCache]: Analyzing trace with hash -51811783, now seen corresponding path program 1 times [2020-10-22 02:19:33,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:19:33,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630121041] [2020-10-22 02:19:33,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:19:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:19:33,540 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 02:19:33,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630121041] [2020-10-22 02:19:33,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:19:33,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:19:33,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [802311969] [2020-10-22 02:19:33,541 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:19:33,543 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:19:33,545 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-22 02:19:33,545 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:19:33,545 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:19:33,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:19:33,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:19:33,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:19:33,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:19:33,548 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-10-22 02:19:33,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:19:33,576 INFO L93 Difference]: Finished difference Result 111 states and 252 transitions. [2020-10-22 02:19:33,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:19:33,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-22 02:19:33,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:19:33,579 INFO L225 Difference]: With dead ends: 111 [2020-10-22 02:19:33,579 INFO L226 Difference]: Without dead ends: 111 [2020-10-22 02:19:33,580 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 02:19:33,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-22 02:19:33,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-10-22 02:19:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-22 02:19:33,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 252 transitions. [2020-10-22 02:19:33,593 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 252 transitions. Word has length 7 [2020-10-22 02:19:33,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:19:33,593 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 252 transitions. [2020-10-22 02:19:33,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:19:33,594 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 252 transitions. [2020-10-22 02:19:33,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-22 02:19:33,594 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:19:33,595 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:19:33,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 02:19:33,595 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:19:33,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:19:33,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1592805591, now seen corresponding path program 1 times [2020-10-22 02:19:33,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:19:33,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153748312] [2020-10-22 02:19:33,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:19:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:19:33,682 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 02:19:33,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153748312] [2020-10-22 02:19:33,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:19:33,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:19:33,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2000691150] [2020-10-22 02:19:33,683 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:19:33,684 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:19:33,686 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 14 transitions. [2020-10-22 02:19:33,687 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:19:33,778 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:19:33,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:19:33,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:19:33,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:19:33,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:19:33,779 INFO L87 Difference]: Start difference. First operand 111 states and 252 transitions. Second operand 4 states. [2020-10-22 02:19:33,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:19:33,857 INFO L93 Difference]: Finished difference Result 107 states and 241 transitions. [2020-10-22 02:19:33,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:19:33,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-22 02:19:33,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:19:33,861 INFO L225 Difference]: With dead ends: 107 [2020-10-22 02:19:33,861 INFO L226 Difference]: Without dead ends: 107 [2020-10-22 02:19:33,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:19:33,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-22 02:19:33,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-22 02:19:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-22 02:19:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 241 transitions. [2020-10-22 02:19:33,871 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 241 transitions. Word has length 8 [2020-10-22 02:19:33,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:19:33,871 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 241 transitions. [2020-10-22 02:19:33,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:19:33,872 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 241 transitions. [2020-10-22 02:19:33,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-22 02:19:33,872 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:19:33,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:19:33,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 02:19:33,873 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:19:33,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:19:33,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1606197126, now seen corresponding path program 1 times [2020-10-22 02:19:33,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:19:33,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489408965] [2020-10-22 02:19:33,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:19:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:19:33,955 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 02:19:33,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489408965] [2020-10-22 02:19:33,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:19:33,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:19:33,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2101020256] [2020-10-22 02:19:33,957 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:19:33,958 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:19:33,960 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 12 transitions. [2020-10-22 02:19:33,961 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:19:34,008 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:19:34,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:19:34,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:19:34,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:19:34,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:19:34,010 INFO L87 Difference]: Start difference. First operand 107 states and 241 transitions. Second operand 3 states. [2020-10-22 02:19:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:19:34,052 INFO L93 Difference]: Finished difference Result 103 states and 230 transitions. [2020-10-22 02:19:34,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:19:34,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-10-22 02:19:34,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:19:34,056 INFO L225 Difference]: With dead ends: 103 [2020-10-22 02:19:34,056 INFO L226 Difference]: Without dead ends: 103 [2020-10-22 02:19:34,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 02:19:34,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-22 02:19:34,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-10-22 02:19:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-22 02:19:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 230 transitions. [2020-10-22 02:19:34,079 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 230 transitions. Word has length 8 [2020-10-22 02:19:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:19:34,080 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 230 transitions. [2020-10-22 02:19:34,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:19:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 230 transitions. [2020-10-22 02:19:34,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 02:19:34,081 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:19:34,081 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:19:34,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 02:19:34,081 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:19:34,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:19:34,082 INFO L82 PathProgramCache]: Analyzing trace with hash -2132364918, now seen corresponding path program 1 times [2020-10-22 02:19:34,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:19:34,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915255963] [2020-10-22 02:19:34,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:19:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:19:34,221 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 02:19:34,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915255963] [2020-10-22 02:19:34,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:19:34,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:19:34,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1797497266] [2020-10-22 02:19:34,222 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:19:34,224 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:19:34,226 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 24 transitions. [2020-10-22 02:19:34,226 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:19:34,452 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:19:34,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:19:34,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:19:34,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:19:34,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:19:34,453 INFO L87 Difference]: Start difference. First operand 103 states and 230 transitions. Second operand 5 states. [2020-10-22 02:19:34,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:19:34,542 INFO L93 Difference]: Finished difference Result 111 states and 244 transitions. [2020-10-22 02:19:34,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:19:34,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-22 02:19:34,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:19:34,546 INFO L225 Difference]: With dead ends: 111 [2020-10-22 02:19:34,547 INFO L226 Difference]: Without dead ends: 111 [2020-10-22 02:19:34,547 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:19:34,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-22 02:19:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-10-22 02:19:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-22 02:19:34,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 244 transitions. [2020-10-22 02:19:34,556 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 244 transitions. Word has length 9 [2020-10-22 02:19:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:19:34,556 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 244 transitions. [2020-10-22 02:19:34,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:19:34,557 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 244 transitions. [2020-10-22 02:19:34,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:19:34,558 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:19:34,558 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:19:34,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 02:19:34,558 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:19:34,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:19:34,559 INFO L82 PathProgramCache]: Analyzing trace with hash -505503669, now seen corresponding path program 1 times [2020-10-22 02:19:34,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:19:34,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445787812] [2020-10-22 02:19:34,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:19:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:19:34,712 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 02:19:34,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445787812] [2020-10-22 02:19:34,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:19:34,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:19:34,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [671153131] [2020-10-22 02:19:34,714 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:19:34,716 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:19:34,720 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 33 transitions. [2020-10-22 02:19:34,720 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:19:35,107 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2104#(and (= ~y~0 1) (not (= 2 ~y$w_buff0~0)) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0))] [2020-10-22 02:19:35,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 02:19:35,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:19:35,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 02:19:35,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:19:35,108 INFO L87 Difference]: Start difference. First operand 111 states and 244 transitions. Second operand 8 states. [2020-10-22 02:19:35,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:19:35,295 INFO L93 Difference]: Finished difference Result 131 states and 274 transitions. [2020-10-22 02:19:35,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:19:35,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-10-22 02:19:35,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:19:35,298 INFO L225 Difference]: With dead ends: 131 [2020-10-22 02:19:35,298 INFO L226 Difference]: Without dead ends: 113 [2020-10-22 02:19:35,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-10-22 02:19:35,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-22 02:19:35,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2020-10-22 02:19:35,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-22 02:19:35,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 202 transitions. [2020-10-22 02:19:35,306 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 202 transitions. Word has length 11 [2020-10-22 02:19:35,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:19:35,306 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 202 transitions. [2020-10-22 02:19:35,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 02:19:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 202 transitions. [2020-10-22 02:19:35,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:19:35,308 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:19:35,308 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:19:35,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 02:19:35,308 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:19:35,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:19:35,309 INFO L82 PathProgramCache]: Analyzing trace with hash -505718933, now seen corresponding path program 1 times [2020-10-22 02:19:35,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:19:35,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438833164] [2020-10-22 02:19:35,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:19:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:19:35,414 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 02:19:35,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438833164] [2020-10-22 02:19:35,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:19:35,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:19:35,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1743985991] [2020-10-22 02:19:35,416 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:19:35,418 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:19:35,423 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 45 transitions. [2020-10-22 02:19:35,423 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:19:35,620 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 3, 3, 2, 1] term [2020-10-22 02:19:35,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:19:35,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:19:35,635 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 3, 2, 1] term [2020-10-22 02:19:35,636 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:19:35,637 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-22 02:19:35,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:19:35,704 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:19:35,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:19:35,722 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:19:35,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:19:35,906 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2437#(not (= 2 ~x~0))] [2020-10-22 02:19:35,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:19:35,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:19:35,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:19:35,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:19:35,907 INFO L87 Difference]: Start difference. First operand 95 states and 202 transitions. Second operand 6 states. [2020-10-22 02:19:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:19:36,017 INFO L93 Difference]: Finished difference Result 131 states and 271 transitions. [2020-10-22 02:19:36,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:19:36,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-22 02:19:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:19:36,019 INFO L225 Difference]: With dead ends: 131 [2020-10-22 02:19:36,019 INFO L226 Difference]: Without dead ends: 71 [2020-10-22 02:19:36,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:19:36,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-22 02:19:36,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-22 02:19:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-22 02:19:36,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 138 transitions. [2020-10-22 02:19:36,023 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 138 transitions. Word has length 11 [2020-10-22 02:19:36,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:19:36,023 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 138 transitions. [2020-10-22 02:19:36,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:19:36,023 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 138 transitions. [2020-10-22 02:19:36,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:19:36,024 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:19:36,024 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:19:36,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 02:19:36,025 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:19:36,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:19:36,025 INFO L82 PathProgramCache]: Analyzing trace with hash -548127863, now seen corresponding path program 2 times [2020-10-22 02:19:36,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:19:36,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586112775] [2020-10-22 02:19:36,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:19:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:19:36,123 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 02:19:36,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586112775] [2020-10-22 02:19:36,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:19:36,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:19:36,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1682647095] [2020-10-22 02:19:36,124 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:19:36,126 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:19:36,131 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 46 transitions. [2020-10-22 02:19:36,132 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:19:36,141 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:19:36,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:19:36,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:19:36,450 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2721#(not (= 2 ~__unbuffered_cnt~0))] [2020-10-22 02:19:36,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:19:36,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:19:36,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:19:36,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:19:36,452 INFO L87 Difference]: Start difference. First operand 71 states and 138 transitions. Second operand 5 states. [2020-10-22 02:19:36,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:19:36,505 INFO L93 Difference]: Finished difference Result 49 states and 83 transitions. [2020-10-22 02:19:36,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:19:36,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-22 02:19:36,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:19:36,507 INFO L225 Difference]: With dead ends: 49 [2020-10-22 02:19:36,507 INFO L226 Difference]: Without dead ends: 24 [2020-10-22 02:19:36,507 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:19:36,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-22 02:19:36,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-22 02:19:36,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-22 02:19:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-10-22 02:19:36,510 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 11 [2020-10-22 02:19:36,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:19:36,510 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-10-22 02:19:36,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:19:36,510 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-10-22 02:19:36,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 02:19:36,511 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:19:36,511 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:19:36,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 02:19:36,511 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:19:36,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:19:36,512 INFO L82 PathProgramCache]: Analyzing trace with hash -521387093, now seen corresponding path program 1 times [2020-10-22 02:19:36,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:19:36,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244295267] [2020-10-22 02:19:36,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:19:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:19:36,555 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:19:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:19:36,606 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:19:36,654 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 02:19:36,654 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 02:19:36,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 02:19:36,655 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 02:19:36,663 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L797-->L804: Formula: (let ((.cse6 (= (mod ~y$w_buff1_used~0_In-855288228 256) 0)) (.cse7 (= (mod ~y$r_buff1_thd0~0_In-855288228 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In-855288228 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In-855288228 256) 0))) (let ((.cse0 (or .cse9 .cse8)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse1 (not .cse7)) (.cse2 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (= ~y$r_buff1_thd0~0_In-855288228 ~y$r_buff1_thd0~0_Out-855288228) (or (and .cse0 (or (and (= ~y$w_buff1~0_In-855288228 ~y~0_Out-855288228) .cse1 .cse2) (and .cse3 (= ~y~0_In-855288228 ~y~0_Out-855288228)))) (and (= ~y$w_buff0~0_In-855288228 ~y~0_Out-855288228) .cse4 .cse5)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-855288228 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-855288228|) (or (and .cse0 (= ~y$w_buff0_used~0_In-855288228 ~y$w_buff0_used~0_Out-855288228)) (and (= ~y$w_buff0_used~0_Out-855288228 0) .cse4 .cse5)) (or (and .cse1 .cse2 (= ~y$w_buff1_used~0_Out-855288228 0)) (and .cse3 (= ~y$w_buff1_used~0_Out-855288228 ~y$w_buff1_used~0_In-855288228))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-855288228 0)) (= ~y$r_buff0_thd0~0_Out-855288228 ~y$r_buff0_thd0~0_In-855288228)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-855288228|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-855288228, ~y$w_buff1~0=~y$w_buff1~0_In-855288228, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-855288228, ~y$w_buff0~0=~y$w_buff0~0_In-855288228, ~y~0=~y~0_In-855288228, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-855288228, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-855288228} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-855288228, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-855288228|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-855288228|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-855288228|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-855288228|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-855288228|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-855288228|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-855288228|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-855288228, ~y$w_buff1~0=~y$w_buff1~0_In-855288228, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-855288228, ~y$w_buff0~0=~y$w_buff0~0_In-855288228, ~y~0=~y~0_Out-855288228, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-855288228, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-855288228} 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 02:19:36,667 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 02:19:36,668 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [733] [2020-10-22 02:19:36,669 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 02:19:36,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,670 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 02:19:36,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,670 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 02:19:36,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,671 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:19:36,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,671 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:19:36,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,672 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:19:36,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,672 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:19:36,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,673 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 02:19:36,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,673 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 02:19:36,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,673 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 02:19:36,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,674 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 02:19:36,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:19:36,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:19:36,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:19:36,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:19:36,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:19:36,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,677 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 02:19:36,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,677 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 02:19:36,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,677 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 02:19:36,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,678 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:19:36,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,678 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:19:36,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:19:36,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:19:36,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:19:36,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 02:19:36 BasicIcfg [2020-10-22 02:19:36,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 02:19:36,727 INFO L168 Benchmark]: Toolchain (without parser) took 17244.09 ms. Allocated memory was 139.5 MB in the beginning and 361.2 MB in the end (delta: 221.8 MB). Free memory was 101.7 MB in the beginning and 172.9 MB in the end (delta: -71.2 MB). Peak memory consumption was 150.6 MB. Max. memory is 7.1 GB. [2020-10-22 02:19:36,728 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.6 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-10-22 02:19:36,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 869.52 ms. Allocated memory was 139.5 MB in the beginning and 207.1 MB in the end (delta: 67.6 MB). Free memory was 100.5 MB in the beginning and 158.6 MB in the end (delta: -58.1 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2020-10-22 02:19:36,729 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.52 ms. Allocated memory is still 207.1 MB. Free memory was 158.6 MB in the beginning and 155.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-10-22 02:19:36,730 INFO L168 Benchmark]: Boogie Preprocessor took 59.16 ms. Allocated memory is still 207.1 MB. Free memory was 155.5 MB in the beginning and 152.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-10-22 02:19:36,731 INFO L168 Benchmark]: RCFGBuilder took 2091.93 ms. Allocated memory was 207.1 MB in the beginning and 246.9 MB in the end (delta: 39.8 MB). Free memory was 152.5 MB in the beginning and 190.6 MB in the end (delta: -38.1 MB). Peak memory consumption was 98.5 MB. Max. memory is 7.1 GB. [2020-10-22 02:19:36,731 INFO L168 Benchmark]: TraceAbstraction took 14133.86 ms. Allocated memory was 246.9 MB in the beginning and 361.2 MB in the end (delta: 114.3 MB). Free memory was 188.6 MB in the beginning and 172.9 MB in the end (delta: 15.7 MB). Peak memory consumption was 130.0 MB. Max. memory is 7.1 GB. [2020-10-22 02:19:36,736 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.6 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 869.52 ms. Allocated memory was 139.5 MB in the beginning and 207.1 MB in the end (delta: 67.6 MB). Free memory was 100.5 MB in the beginning and 158.6 MB in the end (delta: -58.1 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.52 ms. Allocated memory is still 207.1 MB. Free memory was 158.6 MB in the beginning and 155.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.16 ms. Allocated memory is still 207.1 MB. Free memory was 155.5 MB in the beginning and 152.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2091.93 ms. Allocated memory was 207.1 MB in the beginning and 246.9 MB in the end (delta: 39.8 MB). Free memory was 152.5 MB in the beginning and 190.6 MB in the end (delta: -38.1 MB). Peak memory consumption was 98.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14133.86 ms. Allocated memory was 246.9 MB in the beginning and 361.2 MB in the end (delta: 114.3 MB). Free memory was 188.6 MB in the beginning and 172.9 MB in the end (delta: 15.7 MB). Peak memory consumption was 130.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 554 VarBasedMoverChecksPositive, 28 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 34 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.1s, 87 PlacesBefore, 26 PlacesAfterwards, 83 TransitionsBefore, 19 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 83 TotalNumberOfCompositions, 2660 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; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L792] 0 pthread_t t2474; [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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] [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L745] 1 x = 1 VAL [__unbuffered_cnt=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] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, 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] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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] [L748] 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) [L748] 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) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 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 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 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 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L768] 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) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] 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) [L768] 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) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 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 [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 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 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 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) [L810] 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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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)) [L813] 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)) [L813] 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) [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] 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) [L813] 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)) [L813] 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)) [L814] 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)) [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_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L814] 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)) [L814] 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)) [L815] 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)) [L815] EXPR 0 !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) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe029_power.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, 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, 81 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.9s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.1s, HoareTripleCheckerStatistics: 106 SDtfs, 93 SDslu, 137 SDs, 0 SdLazy, 151 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s 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, 8 MinimizatonAttempts, 18 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 5186 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...