/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix032_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 13:06:37,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 13:06:37,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 13:06:37,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 13:06:37,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 13:06:37,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 13:06:37,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 13:06:37,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 13:06:37,434 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 13:06:37,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 13:06:37,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 13:06:37,439 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 13:06:37,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 13:06:37,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 13:06:37,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 13:06:37,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 13:06:37,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 13:06:37,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 13:06:37,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 13:06:37,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 13:06:37,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 13:06:37,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 13:06:37,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 13:06:37,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 13:06:37,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 13:06:37,475 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 13:06:37,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 13:06:37,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 13:06:37,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 13:06:37,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 13:06:37,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 13:06:37,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 13:06:37,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 13:06:37,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 13:06:37,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 13:06:37,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 13:06:37,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 13:06:37,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 13:06:37,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 13:06:37,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 13:06:37,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 13:06:37,495 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-16 13:06:37,520 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 13:06:37,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 13:06:37,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 13:06:37,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 13:06:37,522 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 13:06:37,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 13:06:37,522 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 13:06:37,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 13:06:37,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 13:06:37,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 13:06:37,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 13:06:37,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 13:06:37,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 13:06:37,523 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 13:06:37,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 13:06:37,524 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 13:06:37,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 13:06:37,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 13:06:37,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 13:06:37,525 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 13:06:37,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 13:06:37,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 13:06:37,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 13:06:37,526 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 13:06:37,526 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 13:06:37,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 13:06:37,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 13:06:37,526 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-16 13:06:37,526 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 13:06:37,527 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 13:06:37,527 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-16 13:06:37,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 13:06:37,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 13:06:37,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 13:06:37,855 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 13:06:37,856 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 13:06:37,857 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_pso.opt.i [2020-10-16 13:06:37,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/01e3af2fb/30932902d0804f36ade8e9938f864660/FLAG8383e99ba [2020-10-16 13:06:38,518 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 13:06:38,519 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix032_pso.opt.i [2020-10-16 13:06:38,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/01e3af2fb/30932902d0804f36ade8e9938f864660/FLAG8383e99ba [2020-10-16 13:06:38,744 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/01e3af2fb/30932902d0804f36ade8e9938f864660 [2020-10-16 13:06:38,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 13:06:38,754 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 13:06:38,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 13:06:38,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 13:06:38,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 13:06:38,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:06:38" (1/1) ... [2020-10-16 13:06:38,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25971070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:06:38, skipping insertion in model container [2020-10-16 13:06:38,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:06:38" (1/1) ... [2020-10-16 13:06:38,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 13:06:38,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 13:06:39,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:06:39,298 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 13:06:39,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:06:39,457 INFO L208 MainTranslator]: Completed translation [2020-10-16 13:06:39,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:06:39 WrapperNode [2020-10-16 13:06:39,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 13:06:39,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 13:06:39,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 13:06:39,459 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 13:06:39,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:06:39" (1/1) ... [2020-10-16 13:06:39,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:06:39" (1/1) ... [2020-10-16 13:06:39,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 13:06:39,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 13:06:39,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 13:06:39,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 13:06:39,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:06:39" (1/1) ... [2020-10-16 13:06:39,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:06:39" (1/1) ... [2020-10-16 13:06:39,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:06:39" (1/1) ... [2020-10-16 13:06:39,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:06:39" (1/1) ... [2020-10-16 13:06:39,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:06:39" (1/1) ... [2020-10-16 13:06:39,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:06:39" (1/1) ... [2020-10-16 13:06:39,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:06:39" (1/1) ... [2020-10-16 13:06:39,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 13:06:39,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 13:06:39,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 13:06:39,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 13:06:39,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:06:39" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-16 13:06:39,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 13:06:39,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 13:06:39,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 13:06:39,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 13:06:39,660 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 13:06:39,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 13:06:39,661 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 13:06:39,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 13:06:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 13:06:39,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 13:06:39,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 13:06:39,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 13:06:39,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 13:06:39,667 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 13:06:41,410 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 13:06:41,411 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 13:06:41,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:06:41 BoogieIcfgContainer [2020-10-16 13:06:41,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 13:06:41,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 13:06:41,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 13:06:41,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 13:06:41,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:06:38" (1/3) ... [2020-10-16 13:06:41,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbd9ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:06:41, skipping insertion in model container [2020-10-16 13:06:41,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:06:39" (2/3) ... [2020-10-16 13:06:41,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbd9ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:06:41, skipping insertion in model container [2020-10-16 13:06:41,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:06:41" (3/3) ... [2020-10-16 13:06:41,423 INFO L111 eAbstractionObserver]: Analyzing ICFG mix032_pso.opt.i [2020-10-16 13:06:41,436 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 13:06:41,436 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 13:06:41,444 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 13:06:41,445 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 13:06:41,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,502 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,503 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,506 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,506 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,521 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,521 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,522 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,522 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,532 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,533 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,533 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,537 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,537 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,541 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,545 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:06:41,548 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 13:06:41,563 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 13:06:41,587 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 13:06:41,587 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 13:06:41,587 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 13:06:41,587 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-16 13:06:41,588 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 13:06:41,588 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 13:06:41,588 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 13:06:41,588 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 13:06:41,611 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 13:06:41,612 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 100 transitions, 215 flow [2020-10-16 13:06:41,615 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 100 transitions, 215 flow [2020-10-16 13:06:41,617 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 215 flow [2020-10-16 13:06:41,689 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2020-10-16 13:06:41,689 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 13:06:41,698 INFO L80 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-16 13:06:41,705 INFO L117 LiptonReduction]: Number of co-enabled transitions 1784 [2020-10-16 13:06:41,989 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-10-16 13:06:42,437 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 13:06:44,351 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2020-10-16 13:06:44,519 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-16 13:06:44,534 INFO L132 LiptonReduction]: Checked pairs total: 5307 [2020-10-16 13:06:44,534 INFO L134 LiptonReduction]: Total number of compositions: 86 [2020-10-16 13:06:44,542 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-10-16 13:06:44,607 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 750 states. [2020-10-16 13:06:44,610 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states. [2020-10-16 13:06:44,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 13:06:44,617 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:06:44,618 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:06:44,618 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:06:44,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:06:44,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1302785352, now seen corresponding path program 1 times [2020-10-16 13:06:44,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:06:44,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193266148] [2020-10-16 13:06:44,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:06:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:06:44,960 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-16 13:06:44,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193266148] [2020-10-16 13:06:44,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:06:44,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:06:44,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1877038438] [2020-10-16 13:06:44,964 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:06:44,968 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:06:44,980 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-16 13:06:44,980 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:06:44,985 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:06:44,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:06:44,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:06:45,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:06:45,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:06:45,005 INFO L87 Difference]: Start difference. First operand 750 states. Second operand 3 states. [2020-10-16 13:06:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:06:45,069 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-10-16 13:06:45,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:06:45,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 13:06:45,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:06:45,106 INFO L225 Difference]: With dead ends: 650 [2020-10-16 13:06:45,107 INFO L226 Difference]: Without dead ends: 530 [2020-10-16 13:06:45,108 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-16 13:06:45,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-10-16 13:06:45,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-10-16 13:06:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-10-16 13:06:45,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1622 transitions. [2020-10-16 13:06:45,247 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1622 transitions. Word has length 7 [2020-10-16 13:06:45,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:06:45,249 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1622 transitions. [2020-10-16 13:06:45,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:06:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1622 transitions. [2020-10-16 13:06:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:06:45,251 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:06:45,251 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:06:45,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 13:06:45,251 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:06:45,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:06:45,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2141274007, now seen corresponding path program 1 times [2020-10-16 13:06:45,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:06:45,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809148665] [2020-10-16 13:06:45,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:06:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:06:45,337 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-16 13:06:45,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809148665] [2020-10-16 13:06:45,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:06:45,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:06:45,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1267194932] [2020-10-16 13:06:45,339 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:06:45,340 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:06:45,341 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-16 13:06:45,342 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:06:45,342 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:06:45,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:06:45,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:06:45,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:06:45,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:06:45,345 INFO L87 Difference]: Start difference. First operand 530 states and 1622 transitions. Second operand 3 states. [2020-10-16 13:06:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:06:45,354 INFO L93 Difference]: Finished difference Result 482 states and 1450 transitions. [2020-10-16 13:06:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:06:45,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 13:06:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:06:45,359 INFO L225 Difference]: With dead ends: 482 [2020-10-16 13:06:45,359 INFO L226 Difference]: Without dead ends: 482 [2020-10-16 13:06:45,360 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-16 13:06:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-10-16 13:06:45,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2020-10-16 13:06:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-16 13:06:45,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1450 transitions. [2020-10-16 13:06:45,377 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1450 transitions. Word has length 9 [2020-10-16 13:06:45,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:06:45,378 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1450 transitions. [2020-10-16 13:06:45,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:06:45,378 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1450 transitions. [2020-10-16 13:06:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:06:45,380 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:06:45,381 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:06:45,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 13:06:45,381 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:06:45,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:06:45,382 INFO L82 PathProgramCache]: Analyzing trace with hash 472840266, now seen corresponding path program 1 times [2020-10-16 13:06:45,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:06:45,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004885237] [2020-10-16 13:06:45,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:06:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:06:45,445 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-16 13:06:45,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004885237] [2020-10-16 13:06:45,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:06:45,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:06:45,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [910764926] [2020-10-16 13:06:45,447 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:06:45,449 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:06:45,452 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 27 transitions. [2020-10-16 13:06:45,452 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:06:45,520 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:06:45,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:06:45,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:06:45,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:06:45,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:06:45,521 INFO L87 Difference]: Start difference. First operand 482 states and 1450 transitions. Second operand 3 states. [2020-10-16 13:06:45,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:06:45,530 INFO L93 Difference]: Finished difference Result 458 states and 1368 transitions. [2020-10-16 13:06:45,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:06:45,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 13:06:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:06:45,535 INFO L225 Difference]: With dead ends: 458 [2020-10-16 13:06:45,535 INFO L226 Difference]: Without dead ends: 458 [2020-10-16 13:06:45,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-16 13:06:45,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-10-16 13:06:45,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2020-10-16 13:06:45,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-10-16 13:06:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1368 transitions. [2020-10-16 13:06:45,551 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1368 transitions. Word has length 11 [2020-10-16 13:06:45,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:06:45,552 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 1368 transitions. [2020-10-16 13:06:45,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:06:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1368 transitions. [2020-10-16 13:06:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:06:45,554 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:06:45,555 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:06:45,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 13:06:45,555 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:06:45,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:06:45,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1422337945, now seen corresponding path program 1 times [2020-10-16 13:06:45,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:06:45,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931521324] [2020-10-16 13:06:45,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:06:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:06:45,636 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-16 13:06:45,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931521324] [2020-10-16 13:06:45,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:06:45,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:06:45,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [740403960] [2020-10-16 13:06:45,638 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:06:45,640 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:06:45,645 INFO L258 McrAutomatonBuilder]: Finished intersection with 35 states and 61 transitions. [2020-10-16 13:06:45,645 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:06:45,713 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-16 13:06:45,714 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:45,720 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-16 13:06:45,721 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:45,735 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-16 13:06:45,735 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:45,749 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-16 13:06:45,749 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:45,802 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:06:45,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:06:45,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:06:45,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:06:45,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:06:45,804 INFO L87 Difference]: Start difference. First operand 458 states and 1368 transitions. Second operand 4 states. [2020-10-16 13:06:45,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:06:45,837 INFO L93 Difference]: Finished difference Result 440 states and 1162 transitions. [2020-10-16 13:06:45,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:06:45,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 13:06:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:06:45,840 INFO L225 Difference]: With dead ends: 440 [2020-10-16 13:06:45,840 INFO L226 Difference]: Without dead ends: 320 [2020-10-16 13:06:45,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 9 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:06:45,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-10-16 13:06:45,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2020-10-16 13:06:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2020-10-16 13:06:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 816 transitions. [2020-10-16 13:06:45,851 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 816 transitions. Word has length 13 [2020-10-16 13:06:45,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:06:45,851 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 816 transitions. [2020-10-16 13:06:45,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:06:45,851 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 816 transitions. [2020-10-16 13:06:45,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 13:06:45,853 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:06:45,853 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:06:45,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 13:06:45,853 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:06:45,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:06:45,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1033589835, now seen corresponding path program 1 times [2020-10-16 13:06:45,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:06:45,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602799019] [2020-10-16 13:06:45,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:06:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:06:45,990 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-16 13:06:45,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602799019] [2020-10-16 13:06:45,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:06:45,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:06:45,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1934812037] [2020-10-16 13:06:45,992 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:06:45,995 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:06:46,002 INFO L258 McrAutomatonBuilder]: Finished intersection with 28 states and 39 transitions. [2020-10-16 13:06:46,003 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:06:46,016 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-16 13:06:46,016 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:46,073 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:06:46,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:06:46,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:06:46,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:06:46,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:06:46,074 INFO L87 Difference]: Start difference. First operand 320 states and 816 transitions. Second operand 5 states. [2020-10-16 13:06:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:06:46,118 INFO L93 Difference]: Finished difference Result 265 states and 624 transitions. [2020-10-16 13:06:46,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:06:46,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 13:06:46,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:06:46,120 INFO L225 Difference]: With dead ends: 265 [2020-10-16 13:06:46,120 INFO L226 Difference]: Without dead ends: 205 [2020-10-16 13:06:46,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:06:46,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-10-16 13:06:46,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2020-10-16 13:06:46,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-10-16 13:06:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 471 transitions. [2020-10-16 13:06:46,128 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 471 transitions. Word has length 15 [2020-10-16 13:06:46,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:06:46,128 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 471 transitions. [2020-10-16 13:06:46,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:06:46,128 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 471 transitions. [2020-10-16 13:06:46,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 13:06:46,129 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:06:46,130 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:06:46,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 13:06:46,130 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:06:46,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:06:46,131 INFO L82 PathProgramCache]: Analyzing trace with hash -888452627, now seen corresponding path program 1 times [2020-10-16 13:06:46,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:06:46,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273892126] [2020-10-16 13:06:46,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:06:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:06:46,360 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-16 13:06:46,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273892126] [2020-10-16 13:06:46,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:06:46,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:06:46,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1574478530] [2020-10-16 13:06:46,362 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:06:46,367 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:06:46,384 INFO L258 McrAutomatonBuilder]: Finished intersection with 44 states and 68 transitions. [2020-10-16 13:06:46,384 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:06:46,402 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-16 13:06:46,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:46,530 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:06:46,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 13:06:46,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:06:46,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 13:06:46,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:06:46,531 INFO L87 Difference]: Start difference. First operand 205 states and 471 transitions. Second operand 6 states. [2020-10-16 13:06:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:06:46,587 INFO L93 Difference]: Finished difference Result 186 states and 431 transitions. [2020-10-16 13:06:46,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:06:46,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-16 13:06:46,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:06:46,590 INFO L225 Difference]: With dead ends: 186 [2020-10-16 13:06:46,590 INFO L226 Difference]: Without dead ends: 173 [2020-10-16 13:06:46,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-16 13:06:46,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-10-16 13:06:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2020-10-16 13:06:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-10-16 13:06:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 407 transitions. [2020-10-16 13:06:46,595 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 407 transitions. Word has length 18 [2020-10-16 13:06:46,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:06:46,596 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 407 transitions. [2020-10-16 13:06:46,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 13:06:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 407 transitions. [2020-10-16 13:06:46,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 13:06:46,597 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:06:46,597 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:06:46,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 13:06:46,597 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:06:46,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:06:46,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1726585829, now seen corresponding path program 1 times [2020-10-16 13:06:46,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:06:46,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116313347] [2020-10-16 13:06:46,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:06:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:06:46,660 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-16 13:06:46,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116313347] [2020-10-16 13:06:46,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:06:46,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:06:46,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [340450240] [2020-10-16 13:06:46,661 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:06:46,666 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:06:46,682 INFO L258 McrAutomatonBuilder]: Finished intersection with 52 states and 81 transitions. [2020-10-16 13:06:46,683 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:06:46,769 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:06:46,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:06:46,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:06:46,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:06:46,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:06:46,771 INFO L87 Difference]: Start difference. First operand 173 states and 407 transitions. Second operand 4 states. [2020-10-16 13:06:46,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:06:46,787 INFO L93 Difference]: Finished difference Result 220 states and 505 transitions. [2020-10-16 13:06:46,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:06:46,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-16 13:06:46,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:06:46,788 INFO L225 Difference]: With dead ends: 220 [2020-10-16 13:06:46,788 INFO L226 Difference]: Without dead ends: 92 [2020-10-16 13:06:46,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-16 13:06:46,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-16 13:06:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-16 13:06:46,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-16 13:06:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 185 transitions. [2020-10-16 13:06:46,792 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 185 transitions. Word has length 21 [2020-10-16 13:06:46,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:06:46,792 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 185 transitions. [2020-10-16 13:06:46,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:06:46,792 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 185 transitions. [2020-10-16 13:06:46,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 13:06:46,793 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:06:46,793 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:06:46,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 13:06:46,794 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:06:46,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:06:46,794 INFO L82 PathProgramCache]: Analyzing trace with hash 581597019, now seen corresponding path program 2 times [2020-10-16 13:06:46,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:06:46,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839843653] [2020-10-16 13:06:46,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:06:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:06:47,033 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-16 13:06:47,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839843653] [2020-10-16 13:06:47,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:06:47,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 13:06:47,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2023725772] [2020-10-16 13:06:47,034 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:06:47,038 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:06:47,048 INFO L258 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2020-10-16 13:06:47,048 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:06:47,141 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-16 13:06:47,142 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,143 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:06:47,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,144 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-16 13:06:47,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,146 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:06:47,146 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,147 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:06:47,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,149 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:06:47,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,151 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-16 13:06:47,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,152 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:06:47,153 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,154 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:06:47,154 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,156 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:06:47,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,158 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:06:47,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:06:47,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-16 13:06:47,174 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-16 13:06:47,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:47,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:47,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:47,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,414 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,416 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:06:47,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,418 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:06:47,419 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,420 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,428 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:47,431 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:47,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,442 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:47,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:47,446 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:47,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,462 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:47,471 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:06:47,476 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-16 13:06:47,476 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,571 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,573 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:06:47,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,575 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:06:47,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,577 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:06:47,577 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:06:47,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:47,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,583 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:47,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,589 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:47,598 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:47,602 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,606 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,626 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-16 13:06:47,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,664 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,664 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:06:47,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,669 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:06:47,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,671 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:06:47,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,672 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 3, 3, 2, 2, 1] term [2020-10-16 13:06:47,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,682 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:06:47,688 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:06:47,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,692 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:47,698 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:06:47,704 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:06:47,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,716 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:06:47,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,721 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:47,727 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:06:47,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:06:47,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,749 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:06:47,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,753 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:47,760 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:06:47,764 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:06:47,802 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:06:47,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,805 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,808 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:06:47,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,809 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:06:47,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,811 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 3, 3, 2, 2, 1] term [2020-10-16 13:06:47,811 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,813 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-16 13:06:47,813 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,824 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,828 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-16 13:06:47,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,840 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:47,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:06:47,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:06:47,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,854 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:06:47,855 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:06:47,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:47,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:47,866 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:47,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,885 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:47,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:06:47,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:47,908 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:47,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,916 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:06:47,919 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:47,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,941 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:06:47,942 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:06:47,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:47,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,950 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:47,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,974 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:47,983 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:48,021 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [8884#(and (= ~__unbuffered_p1_EBX~0 1) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0)), 8885#(and (= ~z$r_buff1_thd2~0 0) (not (= (mod ~z$r_buff0_thd3~0 256) 0)) (not (= (mod ~z$w_buff0_used~0 256) 0)) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 1) (= ~__unbuffered_cnt~0 0))] [2020-10-16 13:06:48,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 13:06:48,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:06:48,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 13:06:48,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-10-16 13:06:48,023 INFO L87 Difference]: Start difference. First operand 92 states and 185 transitions. Second operand 12 states. [2020-10-16 13:06:48,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:06:48,307 INFO L93 Difference]: Finished difference Result 117 states and 229 transitions. [2020-10-16 13:06:48,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 13:06:48,308 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-10-16 13:06:48,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:06:48,309 INFO L225 Difference]: With dead ends: 117 [2020-10-16 13:06:48,309 INFO L226 Difference]: Without dead ends: 99 [2020-10-16 13:06:48,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-10-16 13:06:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-16 13:06:48,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2020-10-16 13:06:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-16 13:06:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 184 transitions. [2020-10-16 13:06:48,313 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 184 transitions. Word has length 21 [2020-10-16 13:06:48,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:06:48,314 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 184 transitions. [2020-10-16 13:06:48,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 13:06:48,314 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 184 transitions. [2020-10-16 13:06:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 13:06:48,315 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:06:48,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:06:48,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 13:06:48,315 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:06:48,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:06:48,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1781126017, now seen corresponding path program 3 times [2020-10-16 13:06:48,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:06:48,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971605935] [2020-10-16 13:06:48,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:06:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:06:48,463 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-16 13:06:48,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971605935] [2020-10-16 13:06:48,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:06:48,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:06:48,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1348335369] [2020-10-16 13:06:48,465 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:06:48,469 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:06:48,483 INFO L258 McrAutomatonBuilder]: Finished intersection with 34 states and 45 transitions. [2020-10-16 13:06:48,483 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:06:48,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,551 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:06:48,552 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-16 13:06:48,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,553 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:06:48,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,554 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-16 13:06:48,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,556 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:06:48,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,558 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:06:48,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,559 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:06:48,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,560 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:06:48,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,563 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:06:48,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,566 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:06:48,566 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:06:48,571 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:48,577 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:48,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:48,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:48,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:48,707 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:06:48,708 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,711 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:06:48,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,714 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:06:48,715 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,716 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,717 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:06:48,727 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:06:48,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:48,730 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:48,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:48,739 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:48,747 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:06:48,751 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:48,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:06:48,760 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:06:48,761 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:06:48,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:48,785 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:48,792 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:06:48,793 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,797 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:48,798 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:48,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:48,806 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:48,815 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:48,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,823 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:48,824 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:48,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:48,831 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:48,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:48,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:48,845 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:48,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:48,851 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-16 13:06:48,852 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,053 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 20 [2020-10-16 13:06:49,062 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:06:49,064 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,068 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:06:49,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,070 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:06:49,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,072 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:06:49,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,079 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,080 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:49,096 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:06:49,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:49,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:49,106 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:49,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,113 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,115 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:06:49,116 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:06:49,121 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,122 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:49,135 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,139 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:49,145 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:49,146 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,154 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:49,154 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:49,157 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:49,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,165 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:49,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,177 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,184 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:06:49,189 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-16 13:06:49,189 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,214 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:06:49,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,218 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:06:49,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,220 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:06:49,220 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,221 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,222 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:06:49,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,225 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:06:49,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,233 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,241 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:06:49,249 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:06:49,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,260 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:49,266 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:49,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,272 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,283 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:06:49,284 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:06:49,288 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-16 13:06:49,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,292 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:49,293 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:49,300 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:49,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:49,307 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,308 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,313 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:06:49,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,329 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:06:49,330 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,331 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,337 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,338 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:49,344 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:06:49,346 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,352 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-16 13:06:49,352 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,389 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:06:49,389 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,390 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:06:49,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,392 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,392 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,395 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,396 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:49,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:49,400 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:49,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,408 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,411 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:06:49,412 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:49,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,425 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:06:49,431 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:06:49,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,451 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-16 13:06:49,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:06:49,467 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9203#(and (= ~z$r_buff1_thd2~0 0) (not (= (mod ~z$r_buff0_thd3~0 256) 0)) (not (= (mod ~z$w_buff0_used~0 256) 0)) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 1))] [2020-10-16 13:06:49,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:06:49,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:06:49,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:06:49,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:06:49,469 INFO L87 Difference]: Start difference. First operand 95 states and 184 transitions. Second operand 7 states. [2020-10-16 13:06:49,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:06:49,557 INFO L93 Difference]: Finished difference Result 101 states and 190 transitions. [2020-10-16 13:06:49,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:06:49,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-16 13:06:49,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:06:49,562 INFO L225 Difference]: With dead ends: 101 [2020-10-16 13:06:49,562 INFO L226 Difference]: Without dead ends: 68 [2020-10-16 13:06:49,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-16 13:06:49,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-16 13:06:49,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-10-16 13:06:49,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-16 13:06:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 119 transitions. [2020-10-16 13:06:49,567 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 119 transitions. Word has length 21 [2020-10-16 13:06:49,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:06:49,568 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 119 transitions. [2020-10-16 13:06:49,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:06:49,570 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 119 transitions. [2020-10-16 13:06:49,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 13:06:49,570 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:06:49,570 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:06:49,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 13:06:49,571 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:06:49,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:06:49,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1888292241, now seen corresponding path program 4 times [2020-10-16 13:06:49,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:06:49,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542309164] [2020-10-16 13:06:49,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:06:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:06:49,668 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:06:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:06:49,705 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:06:49,739 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 13:06:49,740 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 13:06:49,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 13:06:49,741 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 13:06:49,761 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L3-->L850: Formula: (let ((.cse6 (= (mod ~z$r_buff1_thd0~0_In1413572323 256) 0)) (.cse7 (= (mod ~z$w_buff1_used~0_In1413572323 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In1413572323 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In1413572323 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (or (and .cse0 .cse1 (= ~z~0_Out1413572323 ~z$w_buff0~0_In1413572323)) (and .cse2 (or (and .cse3 (= ~z~0_In1413572323 ~z~0_Out1413572323)) (and .cse4 (= ~z$w_buff1~0_In1413572323 ~z~0_Out1413572323) .cse5)))) (= ~z$r_buff1_thd0~0_Out1413572323 ~z$r_buff1_thd0~0_In1413572323) (or (and .cse2 (= ~z$w_buff0_used~0_In1413572323 ~z$w_buff0_used~0_Out1413572323)) (and (= ~z$w_buff0_used~0_Out1413572323 0) .cse0 .cse1)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In1413572323 0)) (or (and .cse4 .cse5 (= ~z$w_buff1_used~0_Out1413572323 0)) (and (= ~z$w_buff1_used~0_In1413572323 ~z$w_buff1_used~0_Out1413572323) .cse3)) (= ~z$r_buff0_thd0~0_In1413572323 ~z$r_buff0_thd0~0_Out1413572323)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1413572323, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1413572323, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1413572323, ~z$w_buff0~0=~z$w_buff0~0_In1413572323, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1413572323, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1413572323, ~z$w_buff1~0=~z$w_buff1~0_In1413572323, ~z~0=~z~0_In1413572323} OutVars{ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1413572323|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out1413572323, ~z$w_buff0~0=~z$w_buff0~0_In1413572323, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1413572323, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1413572323|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1413572323|, ~z$w_buff1~0=~z$w_buff1~0_In1413572323, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1413572323|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1413572323|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1413572323|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1413572323, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1413572323, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1413572323, ~z~0=~z~0_Out1413572323} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~z~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2020-10-16 13:06:49,768 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-16 13:06:49,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:06:49,769 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-16 13:06:49,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:06:49,770 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-16 13:06:49,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:06:49,770 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-16 13:06:49,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:06:49,771 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-16 13:06:49,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:06:49,771 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-16 13:06:49,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:06:49,771 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-16 13:06:49,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:06:49,772 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-16 13:06:49,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:06:49,772 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-16 13:06:49,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:06:49,772 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-16 13:06:49,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:06:49,772 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-16 13:06:49,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:06:49,773 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-16 13:06:49,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:06:49,773 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-16 13:06:49,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:06:49,774 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-16 13:06:49,774 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:06:49,774 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-16 13:06:49,774 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:06:49,774 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-16 13:06:49,774 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:06:49,775 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-16 13:06:49,775 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:06:49,775 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-16 13:06:49,775 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:06:49,775 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-16 13:06:49,775 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:06:49,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:06:49 BasicIcfg [2020-10-16 13:06:49,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 13:06:49,855 INFO L168 Benchmark]: Toolchain (without parser) took 11101.78 ms. Allocated memory was 145.2 MB in the beginning and 368.1 MB in the end (delta: 222.8 MB). Free memory was 100.4 MB in the beginning and 297.9 MB in the end (delta: -197.5 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2020-10-16 13:06:49,856 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 13:06:49,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 703.47 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.9 MB in the beginning and 154.0 MB in the end (delta: -54.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2020-10-16 13:06:49,857 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.08 ms. Allocated memory is still 202.4 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 13:06:49,858 INFO L168 Benchmark]: Boogie Preprocessor took 38.52 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 149.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-10-16 13:06:49,859 INFO L168 Benchmark]: RCFGBuilder took 1844.61 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 149.2 MB in the beginning and 85.6 MB in the end (delta: 63.6 MB). Peak memory consumption was 96.2 MB. Max. memory is 7.1 GB. [2020-10-16 13:06:49,859 INFO L168 Benchmark]: TraceAbstraction took 8438.98 ms. Allocated memory was 234.9 MB in the beginning and 368.1 MB in the end (delta: 133.2 MB). Free memory was 84.1 MB in the beginning and 297.9 MB in the end (delta: -213.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 13:06:49,863 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 703.47 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.9 MB in the beginning and 154.0 MB in the end (delta: -54.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.08 ms. Allocated memory is still 202.4 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.52 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 149.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1844.61 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 149.2 MB in the beginning and 85.6 MB in the end (delta: 63.6 MB). Peak memory consumption was 96.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8438.98 ms. Allocated memory was 234.9 MB in the beginning and 368.1 MB in the end (delta: 133.2 MB). Free memory was 84.1 MB in the beginning and 297.9 MB in the end (delta: -213.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 926 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 87 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.9s, 108 PlacesBefore, 36 PlacesAfterwards, 100 TransitionsBefore, 27 TransitionsAfterwards, 1784 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, 5307 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L702] 0 int __unbuffered_p1_EAX = 0; [L704] 0 int __unbuffered_p1_EBX = 0; [L706] 0 int __unbuffered_p2_EAX = 0; [L708] 0 int __unbuffered_p2_EBX = 0; [L710] 0 int a = 0; [L712] 0 int b = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L720] 0 int z = 0; [L721] 0 _Bool z$flush_delayed; [L722] 0 int z$mem_tmp; [L723] 0 _Bool z$r_buff0_thd0; [L724] 0 _Bool z$r_buff0_thd1; [L725] 0 _Bool z$r_buff0_thd2; [L726] 0 _Bool z$r_buff0_thd3; [L727] 0 _Bool z$r_buff1_thd0; [L728] 0 _Bool z$r_buff1_thd1; [L729] 0 _Bool z$r_buff1_thd2; [L730] 0 _Bool z$r_buff1_thd3; [L731] 0 _Bool z$read_delayed; [L732] 0 int *z$read_delayed_var; [L733] 0 int z$w_buff0; [L734] 0 _Bool z$w_buff0_used; [L735] 0 int z$w_buff1; [L736] 0 _Bool z$w_buff1_used; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L834] 0 pthread_t t858; [L835] FCALL, FORK 0 pthread_create(&t858, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t859; [L837] FCALL, FORK 0 pthread_create(&t859, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t860; [L839] FCALL, FORK 0 pthread_create(&t860, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1 = z$w_buff0 [L792] 3 z$w_buff0 = 1 [L793] 3 z$w_buff1_used = z$w_buff0_used [L794] 3 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L796] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L797] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L798] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L799] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L800] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 a = 1 [L806] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 y = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 z$flush_delayed = weak$$choice2 [L769] 2 z$mem_tmp = z [L770] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L771] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L772] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L772] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1 [L772] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L772] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L773] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L774] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0 [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L774] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L775] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L776] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 __unbuffered_p1_EBX = z [L778] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L778] 2 z = z$flush_delayed ? z$mem_tmp : z [L779] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L812] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L812] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L812] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L813] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L813] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L814] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L815] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L816] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 2 return 0; [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L752] 1 return 0; [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.1s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 209 SDtfs, 238 SDslu, 442 SDs, 0 SdLazy, 269 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 94 SyntacticMatches, 24 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=750occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 10961 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...