/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:33:00,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:33:00,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:33:00,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:33:00,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:33:00,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:33:00,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:33:00,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:33:00,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:33:00,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:33:00,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:33:00,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:33:00,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:33:00,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:33:00,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:33:00,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:33:00,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:33:00,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:33:00,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:33:00,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:33:00,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:33:00,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:33:00,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:33:00,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:33:00,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:33:00,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:33:00,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:33:00,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:33:00,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:33:00,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:33:00,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:33:00,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:33:00,429 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:33:00,430 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:33:00,431 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:33:00,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:33:00,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:33:00,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:33:00,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:33:00,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:33:00,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:33:00,435 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:33:00,463 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:33:00,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:33:00,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:33:00,465 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:33:00,465 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:33:00,465 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:33:00,466 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:33:00,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:33:00,466 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:33:00,466 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:33:00,466 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:33:00,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:33:00,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:33:00,471 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:33:00,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:33:00,472 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:33:00,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:33:00,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:33:00,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:33:00,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:33:00,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:33:00,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:33:00,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:33:00,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:33:00,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:33:00,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:33:00,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:33:00,474 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:33:00,474 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:33:00,474 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:33:00,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:33:00,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:33:00,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:33:00,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:33:00,775 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:33:00,775 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:33:00,776 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc.i [2019-12-27 18:33:00,838 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26bf6e15d/e6c3666fae1743be8bb322eac4c96c36/FLAG138d68dd1 [2019-12-27 18:33:01,432 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:33:01,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.oepc.i [2019-12-27 18:33:01,457 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26bf6e15d/e6c3666fae1743be8bb322eac4c96c36/FLAG138d68dd1 [2019-12-27 18:33:01,676 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26bf6e15d/e6c3666fae1743be8bb322eac4c96c36 [2019-12-27 18:33:01,686 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:33:01,688 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:33:01,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:33:01,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:33:01,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:33:01,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:33:01" (1/1) ... [2019-12-27 18:33:01,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:01, skipping insertion in model container [2019-12-27 18:33:01,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:33:01" (1/1) ... [2019-12-27 18:33:01,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:33:01,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:33:02,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:33:02,291 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:33:02,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:33:02,481 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:33:02,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:02 WrapperNode [2019-12-27 18:33:02,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:33:02,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:33:02,483 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:33:02,483 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:33:02,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:02" (1/1) ... [2019-12-27 18:33:02,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:02" (1/1) ... [2019-12-27 18:33:02,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:33:02,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:33:02,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:33:02,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:33:02,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:02" (1/1) ... [2019-12-27 18:33:02,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:02" (1/1) ... [2019-12-27 18:33:02,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:02" (1/1) ... [2019-12-27 18:33:02,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:02" (1/1) ... [2019-12-27 18:33:02,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:02" (1/1) ... [2019-12-27 18:33:02,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:02" (1/1) ... [2019-12-27 18:33:02,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:02" (1/1) ... [2019-12-27 18:33:02,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:33:02,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:33:02,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:33:02,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:33:02,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:33:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:33:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:33:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:33:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:33:02,689 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:33:02,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:33:02,689 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:33:02,690 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:33:02,690 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:33:02,690 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:33:02,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:33:02,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:33:02,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:33:02,692 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:33:03,468 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:33:03,469 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:33:03,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:33:03 BoogieIcfgContainer [2019-12-27 18:33:03,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:33:03,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:33:03,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:33:03,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:33:03,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:33:01" (1/3) ... [2019-12-27 18:33:03,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b693889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:33:03, skipping insertion in model container [2019-12-27 18:33:03,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:02" (2/3) ... [2019-12-27 18:33:03,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b693889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:33:03, skipping insertion in model container [2019-12-27 18:33:03,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:33:03" (3/3) ... [2019-12-27 18:33:03,479 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc.i [2019-12-27 18:33:03,487 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:33:03,488 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:33:03,495 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:33:03,496 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:33:03,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,536 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,537 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,561 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,561 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,561 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,562 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,562 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,570 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,570 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,596 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,597 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,597 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,602 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,602 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,606 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,606 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:03,626 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:33:03,646 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:33:03,647 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:33:03,647 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:33:03,647 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:33:03,647 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:33:03,647 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:33:03,648 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:33:03,648 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:33:03,665 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 18:33:03,667 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 18:33:03,769 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 18:33:03,769 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:33:03,785 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:33:03,807 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 18:33:03,859 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 18:33:03,859 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:33:03,867 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:33:03,887 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 18:33:03,888 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:33:07,909 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2019-12-27 18:33:09,786 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 18:33:09,913 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 18:33:09,936 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-27 18:33:09,936 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 18:33:09,939 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-27 18:33:22,521 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-27 18:33:22,523 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-27 18:33:22,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:33:22,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:33:22,530 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:33:22,530 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:33:22,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:33:22,535 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-27 18:33:22,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:33:22,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942889863] [2019-12-27 18:33:22,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:33:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:33:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:33:22,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942889863] [2019-12-27 18:33:22,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:33:22,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:33:22,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1461315678] [2019-12-27 18:33:22,790 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:33:22,795 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:33:22,811 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:33:22,812 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:33:22,816 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:33:22,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:33:22,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:33:22,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:33:22,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:33:22,835 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-27 18:33:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:33:24,271 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-27 18:33:24,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:33:24,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:33:24,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:33:27,426 INFO L225 Difference]: With dead ends: 87834 [2019-12-27 18:33:27,427 INFO L226 Difference]: Without dead ends: 82738 [2019-12-27 18:33:27,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:33:30,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-27 18:33:32,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-27 18:33:32,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-27 18:33:33,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-27 18:33:33,356 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-27 18:33:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:33:33,356 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-27 18:33:33,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:33:33,356 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-27 18:33:33,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:33:33,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:33:33,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:33:33,366 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:33:33,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:33:33,367 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-27 18:33:33,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:33:33,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832159523] [2019-12-27 18:33:33,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:33:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:33:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:33:33,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832159523] [2019-12-27 18:33:33,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:33:33,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:33:33,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [875743226] [2019-12-27 18:33:33,547 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:33:33,549 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:33:33,554 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:33:33,554 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:33:33,554 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:33:33,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:33:33,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:33:33,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:33:33,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:33:33,557 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-27 18:33:38,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:33:38,229 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-27 18:33:38,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:33:38,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:33:38,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:33:38,624 INFO L225 Difference]: With dead ends: 127286 [2019-12-27 18:33:38,624 INFO L226 Difference]: Without dead ends: 127202 [2019-12-27 18:33:38,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:33:42,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-27 18:33:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-27 18:33:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-27 18:33:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-27 18:33:45,844 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-27 18:33:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:33:45,845 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-27 18:33:45,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:33:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-27 18:33:45,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:33:45,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:33:45,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:33:45,849 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:33:45,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:33:45,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-27 18:33:45,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:33:45,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573251928] [2019-12-27 18:33:45,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:33:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:33:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:33:45,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573251928] [2019-12-27 18:33:45,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:33:45,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:33:45,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2098303704] [2019-12-27 18:33:45,920 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:33:45,922 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:33:45,924 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:33:45,924 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:33:45,924 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:33:45,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:33:45,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:33:45,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:33:45,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:33:45,925 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-27 18:33:46,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:33:46,048 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-27 18:33:46,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:33:46,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:33:46,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:33:46,125 INFO L225 Difference]: With dead ends: 28492 [2019-12-27 18:33:46,125 INFO L226 Difference]: Without dead ends: 28492 [2019-12-27 18:33:46,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:33:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-27 18:33:46,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-27 18:33:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-27 18:33:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-27 18:33:46,758 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-27 18:33:46,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:33:46,759 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-27 18:33:46,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:33:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-27 18:33:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:33:46,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:33:46,761 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:33:46,761 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:33:46,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:33:46,762 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-27 18:33:46,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:33:46,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528555694] [2019-12-27 18:33:46,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:33:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:33:46,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:33:46,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528555694] [2019-12-27 18:33:46,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:33:46,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:33:46,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [672961950] [2019-12-27 18:33:46,863 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:33:46,865 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:33:46,869 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:33:46,869 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:33:46,870 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:33:46,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:33:46,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:33:46,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:33:46,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:33:46,872 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-27 18:33:47,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:33:47,385 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-27 18:33:47,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:33:47,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:33:47,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:33:47,469 INFO L225 Difference]: With dead ends: 41156 [2019-12-27 18:33:47,470 INFO L226 Difference]: Without dead ends: 41141 [2019-12-27 18:33:47,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:33:47,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-27 18:33:50,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-27 18:33:50,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-27 18:33:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-27 18:33:50,239 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-27 18:33:50,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:33:50,239 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-27 18:33:50,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:33:50,239 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-27 18:33:50,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:33:50,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:33:50,251 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:33:50,251 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:33:50,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:33:50,251 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-27 18:33:50,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:33:50,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554976427] [2019-12-27 18:33:50,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:33:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:33:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:33:50,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554976427] [2019-12-27 18:33:50,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:33:50,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:33:50,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1463770640] [2019-12-27 18:33:50,487 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:33:50,490 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:33:50,502 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 110 transitions. [2019-12-27 18:33:50,503 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:33:50,503 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:33:50,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:33:50,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:33:50,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:33:50,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:33:50,504 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-27 18:33:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:33:51,408 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-27 18:33:51,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:33:51,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 18:33:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:33:51,496 INFO L225 Difference]: With dead ends: 48363 [2019-12-27 18:33:51,496 INFO L226 Difference]: Without dead ends: 48336 [2019-12-27 18:33:51,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:33:51,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-27 18:33:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-27 18:33:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-27 18:33:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-27 18:33:52,177 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-27 18:33:52,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:33:52,177 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-27 18:33:52,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:33:52,177 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-27 18:33:52,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:33:52,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:33:52,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:33:52,195 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:33:52,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:33:52,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-27 18:33:52,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:33:52,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811212754] [2019-12-27 18:33:52,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:33:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:33:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:33:52,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811212754] [2019-12-27 18:33:52,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:33:52,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:33:52,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1187746504] [2019-12-27 18:33:52,249 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:33:52,254 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:33:52,259 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:33:52,260 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:33:52,260 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:33:52,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:33:52,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:33:52,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:33:52,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:33:52,262 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 4 states. [2019-12-27 18:33:52,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:33:52,335 INFO L93 Difference]: Finished difference Result 12861 states and 39176 transitions. [2019-12-27 18:33:52,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:33:52,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 18:33:52,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:33:52,758 INFO L225 Difference]: With dead ends: 12861 [2019-12-27 18:33:52,758 INFO L226 Difference]: Without dead ends: 12861 [2019-12-27 18:33:52,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:33:52,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-27 18:33:52,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12721. [2019-12-27 18:33:52,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12721 states. [2019-12-27 18:33:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12721 states to 12721 states and 38766 transitions. [2019-12-27 18:33:52,951 INFO L78 Accepts]: Start accepts. Automaton has 12721 states and 38766 transitions. Word has length 25 [2019-12-27 18:33:52,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:33:52,952 INFO L462 AbstractCegarLoop]: Abstraction has 12721 states and 38766 transitions. [2019-12-27 18:33:52,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:33:52,952 INFO L276 IsEmpty]: Start isEmpty. Operand 12721 states and 38766 transitions. [2019-12-27 18:33:52,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 18:33:52,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:33:52,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:33:52,970 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:33:52,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:33:52,971 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-27 18:33:52,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:33:52,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957573631] [2019-12-27 18:33:52,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:33:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:33:53,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:33:53,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957573631] [2019-12-27 18:33:53,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:33:53,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:33:53,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [844199986] [2019-12-27 18:33:53,051 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:33:53,061 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:33:53,114 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 187 transitions. [2019-12-27 18:33:53,114 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:33:53,115 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:33:53,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:33:53,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:33:53,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:33:53,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:33:53,116 INFO L87 Difference]: Start difference. First operand 12721 states and 38766 transitions. Second operand 5 states. [2019-12-27 18:33:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:33:53,179 INFO L93 Difference]: Finished difference Result 11425 states and 35436 transitions. [2019-12-27 18:33:53,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:33:53,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 18:33:53,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:33:53,197 INFO L225 Difference]: With dead ends: 11425 [2019-12-27 18:33:53,197 INFO L226 Difference]: Without dead ends: 11425 [2019-12-27 18:33:53,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:33:53,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11425 states. [2019-12-27 18:33:53,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11425 to 10977. [2019-12-27 18:33:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2019-12-27 18:33:53,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 34172 transitions. [2019-12-27 18:33:53,371 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 34172 transitions. Word has length 39 [2019-12-27 18:33:53,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:33:53,372 INFO L462 AbstractCegarLoop]: Abstraction has 10977 states and 34172 transitions. [2019-12-27 18:33:53,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:33:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 34172 transitions. [2019-12-27 18:33:53,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:33:53,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:33:53,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:33:53,390 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:33:53,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:33:53,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-27 18:33:53,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:33:53,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985720579] [2019-12-27 18:33:53,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:33:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:33:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:33:53,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985720579] [2019-12-27 18:33:53,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:33:53,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:33:53,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [17749680] [2019-12-27 18:33:53,479 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:33:53,495 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:33:53,694 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 239 states and 471 transitions. [2019-12-27 18:33:53,694 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:33:53,791 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 18:33:53,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:33:53,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:33:53,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:33:53,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:33:53,793 INFO L87 Difference]: Start difference. First operand 10977 states and 34172 transitions. Second operand 7 states. [2019-12-27 18:33:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:33:54,289 INFO L93 Difference]: Finished difference Result 25197 states and 77861 transitions. [2019-12-27 18:33:54,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:33:54,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 18:33:54,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:33:54,312 INFO L225 Difference]: With dead ends: 25197 [2019-12-27 18:33:54,312 INFO L226 Difference]: Without dead ends: 13995 [2019-12-27 18:33:54,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:33:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13995 states. [2019-12-27 18:33:54,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13995 to 9365. [2019-12-27 18:33:54,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2019-12-27 18:33:54,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 29013 transitions. [2019-12-27 18:33:54,485 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 29013 transitions. Word has length 53 [2019-12-27 18:33:54,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:33:54,485 INFO L462 AbstractCegarLoop]: Abstraction has 9365 states and 29013 transitions. [2019-12-27 18:33:54,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:33:54,485 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 29013 transitions. [2019-12-27 18:33:54,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:33:54,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:33:54,501 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:33:54,501 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:33:54,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:33:54,501 INFO L82 PathProgramCache]: Analyzing trace with hash 383407097, now seen corresponding path program 2 times [2019-12-27 18:33:54,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:33:54,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291268028] [2019-12-27 18:33:54,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:33:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:33:54,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:33:54,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291268028] [2019-12-27 18:33:54,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:33:54,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:33:54,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1759419654] [2019-12-27 18:33:54,604 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:33:54,619 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:33:54,751 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 393 transitions. [2019-12-27 18:33:54,751 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:33:54,908 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:33:54,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:33:54,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:33:54,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:33:54,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:33:54,910 INFO L87 Difference]: Start difference. First operand 9365 states and 29013 transitions. Second operand 8 states. [2019-12-27 18:33:55,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:33:55,363 INFO L93 Difference]: Finished difference Result 23182 states and 71788 transitions. [2019-12-27 18:33:55,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:33:55,363 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-27 18:33:55,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:33:55,399 INFO L225 Difference]: With dead ends: 23182 [2019-12-27 18:33:55,400 INFO L226 Difference]: Without dead ends: 18276 [2019-12-27 18:33:55,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:33:55,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-12-27 18:33:55,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 11162. [2019-12-27 18:33:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11162 states. [2019-12-27 18:33:55,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11162 states to 11162 states and 34879 transitions. [2019-12-27 18:33:55,818 INFO L78 Accepts]: Start accepts. Automaton has 11162 states and 34879 transitions. Word has length 53 [2019-12-27 18:33:55,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:33:55,818 INFO L462 AbstractCegarLoop]: Abstraction has 11162 states and 34879 transitions. [2019-12-27 18:33:55,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:33:55,818 INFO L276 IsEmpty]: Start isEmpty. Operand 11162 states and 34879 transitions. [2019-12-27 18:33:55,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:33:55,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:33:55,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:33:55,834 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:33:55,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:33:55,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1401815865, now seen corresponding path program 3 times [2019-12-27 18:33:55,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:33:55,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456797670] [2019-12-27 18:33:55,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:33:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:33:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:33:55,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456797670] [2019-12-27 18:33:55,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:33:55,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:33:55,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [417262425] [2019-12-27 18:33:55,935 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:33:55,951 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:33:56,099 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 453 transitions. [2019-12-27 18:33:56,100 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:33:56,305 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:33:56,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:33:56,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:33:56,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:33:56,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:33:56,306 INFO L87 Difference]: Start difference. First operand 11162 states and 34879 transitions. Second operand 11 states. [2019-12-27 18:33:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:33:58,485 INFO L93 Difference]: Finished difference Result 32552 states and 100072 transitions. [2019-12-27 18:33:58,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 18:33:58,486 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-12-27 18:33:58,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:33:58,523 INFO L225 Difference]: With dead ends: 32552 [2019-12-27 18:33:58,524 INFO L226 Difference]: Without dead ends: 24064 [2019-12-27 18:33:58,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2019-12-27 18:33:58,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24064 states. [2019-12-27 18:33:58,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24064 to 13020. [2019-12-27 18:33:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-12-27 18:33:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 40574 transitions. [2019-12-27 18:33:58,802 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 40574 transitions. Word has length 53 [2019-12-27 18:33:58,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:33:58,802 INFO L462 AbstractCegarLoop]: Abstraction has 13020 states and 40574 transitions. [2019-12-27 18:33:58,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:33:58,802 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 40574 transitions. [2019-12-27 18:33:58,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:33:58,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:33:58,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:33:58,821 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:33:58,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:33:58,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1901485579, now seen corresponding path program 4 times [2019-12-27 18:33:58,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:33:58,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807291911] [2019-12-27 18:33:58,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:33:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:33:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:33:58,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807291911] [2019-12-27 18:33:58,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:33:58,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:33:58,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [582092266] [2019-12-27 18:33:58,908 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:33:58,924 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:33:59,088 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 390 transitions. [2019-12-27 18:33:59,088 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:33:59,350 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 18:33:59,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:33:59,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:33:59,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:33:59,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:33:59,351 INFO L87 Difference]: Start difference. First operand 13020 states and 40574 transitions. Second operand 10 states. [2019-12-27 18:34:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:01,646 INFO L93 Difference]: Finished difference Result 54777 states and 170133 transitions. [2019-12-27 18:34:01,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:34:01,647 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-27 18:34:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:01,716 INFO L225 Difference]: With dead ends: 54777 [2019-12-27 18:34:01,716 INFO L226 Difference]: Without dead ends: 43609 [2019-12-27 18:34:01,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 10 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2019-12-27 18:34:01,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43609 states. [2019-12-27 18:34:02,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43609 to 15177. [2019-12-27 18:34:02,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15177 states. [2019-12-27 18:34:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15177 states to 15177 states and 47717 transitions. [2019-12-27 18:34:02,183 INFO L78 Accepts]: Start accepts. Automaton has 15177 states and 47717 transitions. Word has length 53 [2019-12-27 18:34:02,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:02,183 INFO L462 AbstractCegarLoop]: Abstraction has 15177 states and 47717 transitions. [2019-12-27 18:34:02,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:34:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 15177 states and 47717 transitions. [2019-12-27 18:34:02,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:34:02,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:02,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:02,201 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:34:02,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:02,201 INFO L82 PathProgramCache]: Analyzing trace with hash -9451933, now seen corresponding path program 1 times [2019-12-27 18:34:02,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:02,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842973992] [2019-12-27 18:34:02,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:02,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:34:02,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842973992] [2019-12-27 18:34:02,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:02,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:34:02,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [44870808] [2019-12-27 18:34:02,264 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:02,279 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:02,438 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 390 transitions. [2019-12-27 18:34:02,438 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:02,448 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:34:02,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:34:02,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:02,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:34:02,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:34:02,449 INFO L87 Difference]: Start difference. First operand 15177 states and 47717 transitions. Second operand 3 states. [2019-12-27 18:34:02,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:02,533 INFO L93 Difference]: Finished difference Result 20827 states and 65534 transitions. [2019-12-27 18:34:02,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:34:02,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 18:34:02,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:02,562 INFO L225 Difference]: With dead ends: 20827 [2019-12-27 18:34:02,563 INFO L226 Difference]: Without dead ends: 20827 [2019-12-27 18:34:02,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:34:02,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20827 states. [2019-12-27 18:34:02,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20827 to 18999. [2019-12-27 18:34:02,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18999 states. [2019-12-27 18:34:02,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18999 states to 18999 states and 60329 transitions. [2019-12-27 18:34:02,858 INFO L78 Accepts]: Start accepts. Automaton has 18999 states and 60329 transitions. Word has length 53 [2019-12-27 18:34:02,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:02,858 INFO L462 AbstractCegarLoop]: Abstraction has 18999 states and 60329 transitions. [2019-12-27 18:34:02,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:34:02,858 INFO L276 IsEmpty]: Start isEmpty. Operand 18999 states and 60329 transitions. [2019-12-27 18:34:02,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:34:02,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:02,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:02,879 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:34:02,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:02,880 INFO L82 PathProgramCache]: Analyzing trace with hash 2081547793, now seen corresponding path program 5 times [2019-12-27 18:34:02,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:02,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126299020] [2019-12-27 18:34:02,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:34:02,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126299020] [2019-12-27 18:34:02,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:02,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:34:02,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [401935427] [2019-12-27 18:34:02,984 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:02,999 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:03,112 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 338 transitions. [2019-12-27 18:34:03,112 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:03,215 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 18:34:03,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:34:03,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:03,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:34:03,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:34:03,217 INFO L87 Difference]: Start difference. First operand 18999 states and 60329 transitions. Second operand 11 states. [2019-12-27 18:34:04,132 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-12-27 18:34:07,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:07,169 INFO L93 Difference]: Finished difference Result 63665 states and 197641 transitions. [2019-12-27 18:34:07,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 18:34:07,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-12-27 18:34:07,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:07,271 INFO L225 Difference]: With dead ends: 63665 [2019-12-27 18:34:07,271 INFO L226 Difference]: Without dead ends: 63581 [2019-12-27 18:34:07,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=566, Invalid=1786, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 18:34:07,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63581 states. [2019-12-27 18:34:07,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63581 to 22369. [2019-12-27 18:34:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22369 states. [2019-12-27 18:34:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22369 states to 22369 states and 70393 transitions. [2019-12-27 18:34:07,986 INFO L78 Accepts]: Start accepts. Automaton has 22369 states and 70393 transitions. Word has length 53 [2019-12-27 18:34:07,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:07,986 INFO L462 AbstractCegarLoop]: Abstraction has 22369 states and 70393 transitions. [2019-12-27 18:34:07,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:34:07,987 INFO L276 IsEmpty]: Start isEmpty. Operand 22369 states and 70393 transitions. [2019-12-27 18:34:08,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:34:08,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:08,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:08,024 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:34:08,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:08,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1629843107, now seen corresponding path program 6 times [2019-12-27 18:34:08,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:08,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877236201] [2019-12-27 18:34:08,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:08,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:34:08,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877236201] [2019-12-27 18:34:08,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:08,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:34:08,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2055279280] [2019-12-27 18:34:08,151 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:08,178 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:08,357 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 389 transitions. [2019-12-27 18:34:08,357 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:08,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:34:08,561 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 18:34:08,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:34:08,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:08,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:34:08,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:34:08,563 INFO L87 Difference]: Start difference. First operand 22369 states and 70393 transitions. Second operand 11 states. [2019-12-27 18:34:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:10,692 INFO L93 Difference]: Finished difference Result 39365 states and 120485 transitions. [2019-12-27 18:34:10,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 18:34:10,693 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-12-27 18:34:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:10,748 INFO L225 Difference]: With dead ends: 39365 [2019-12-27 18:34:10,749 INFO L226 Difference]: Without dead ends: 39243 [2019-12-27 18:34:10,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2019-12-27 18:34:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39243 states. [2019-12-27 18:34:11,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39243 to 28182. [2019-12-27 18:34:11,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28182 states. [2019-12-27 18:34:11,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28182 states to 28182 states and 87592 transitions. [2019-12-27 18:34:11,243 INFO L78 Accepts]: Start accepts. Automaton has 28182 states and 87592 transitions. Word has length 53 [2019-12-27 18:34:11,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:11,244 INFO L462 AbstractCegarLoop]: Abstraction has 28182 states and 87592 transitions. [2019-12-27 18:34:11,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:34:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 28182 states and 87592 transitions. [2019-12-27 18:34:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:34:11,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:11,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:11,274 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:34:11,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:11,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1109995221, now seen corresponding path program 7 times [2019-12-27 18:34:11,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:11,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299693950] [2019-12-27 18:34:11,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:34:11,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299693950] [2019-12-27 18:34:11,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:11,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 18:34:11,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2106595604] [2019-12-27 18:34:11,404 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:11,419 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:11,538 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 313 transitions. [2019-12-27 18:34:11,538 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:11,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:34:11,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:34:11,715 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 18:34:11,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:34:11,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:11,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:34:11,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:34:11,716 INFO L87 Difference]: Start difference. First operand 28182 states and 87592 transitions. Second operand 13 states. [2019-12-27 18:34:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:15,069 INFO L93 Difference]: Finished difference Result 61696 states and 187701 transitions. [2019-12-27 18:34:15,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 18:34:15,069 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-12-27 18:34:15,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:15,172 INFO L225 Difference]: With dead ends: 61696 [2019-12-27 18:34:15,172 INFO L226 Difference]: Without dead ends: 61696 [2019-12-27 18:34:15,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=471, Invalid=1785, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 18:34:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61696 states. [2019-12-27 18:34:16,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61696 to 26700. [2019-12-27 18:34:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26700 states. [2019-12-27 18:34:16,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26700 states to 26700 states and 83274 transitions. [2019-12-27 18:34:16,172 INFO L78 Accepts]: Start accepts. Automaton has 26700 states and 83274 transitions. Word has length 53 [2019-12-27 18:34:16,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:16,172 INFO L462 AbstractCegarLoop]: Abstraction has 26700 states and 83274 transitions. [2019-12-27 18:34:16,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:34:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 26700 states and 83274 transitions. [2019-12-27 18:34:16,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:34:16,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:16,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:16,203 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:34:16,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:16,204 INFO L82 PathProgramCache]: Analyzing trace with hash 2099294685, now seen corresponding path program 8 times [2019-12-27 18:34:16,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:16,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727934733] [2019-12-27 18:34:16,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:34:16,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727934733] [2019-12-27 18:34:16,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:16,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:34:16,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1493208584] [2019-12-27 18:34:16,290 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:16,304 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:16,437 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 316 transitions. [2019-12-27 18:34:16,437 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:16,444 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:34:16,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:34:16,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:16,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:34:16,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:34:16,445 INFO L87 Difference]: Start difference. First operand 26700 states and 83274 transitions. Second operand 4 states. [2019-12-27 18:34:16,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:16,674 INFO L93 Difference]: Finished difference Result 26950 states and 81696 transitions. [2019-12-27 18:34:16,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:34:16,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 18:34:16,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:16,713 INFO L225 Difference]: With dead ends: 26950 [2019-12-27 18:34:16,713 INFO L226 Difference]: Without dead ends: 26950 [2019-12-27 18:34:16,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:34:16,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26950 states. [2019-12-27 18:34:17,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26950 to 19975. [2019-12-27 18:34:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19975 states. [2019-12-27 18:34:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19975 states to 19975 states and 61003 transitions. [2019-12-27 18:34:17,037 INFO L78 Accepts]: Start accepts. Automaton has 19975 states and 61003 transitions. Word has length 53 [2019-12-27 18:34:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:17,038 INFO L462 AbstractCegarLoop]: Abstraction has 19975 states and 61003 transitions. [2019-12-27 18:34:17,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:34:17,038 INFO L276 IsEmpty]: Start isEmpty. Operand 19975 states and 61003 transitions. [2019-12-27 18:34:17,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:34:17,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:17,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:17,058 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:34:17,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:17,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2130494140, now seen corresponding path program 1 times [2019-12-27 18:34:17,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:17,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547804209] [2019-12-27 18:34:17,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:34:17,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547804209] [2019-12-27 18:34:17,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:17,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:34:17,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1283036021] [2019-12-27 18:34:17,181 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:17,195 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:17,319 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 382 transitions. [2019-12-27 18:34:17,320 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:17,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:34:17,494 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 18:34:17,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:34:17,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:17,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:34:17,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:34:17,495 INFO L87 Difference]: Start difference. First operand 19975 states and 61003 transitions. Second operand 13 states. [2019-12-27 18:34:20,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:20,695 INFO L93 Difference]: Finished difference Result 32918 states and 98862 transitions. [2019-12-27 18:34:20,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 18:34:20,695 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 18:34:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:20,740 INFO L225 Difference]: With dead ends: 32918 [2019-12-27 18:34:20,741 INFO L226 Difference]: Without dead ends: 32782 [2019-12-27 18:34:20,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 13 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:34:20,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32782 states. [2019-12-27 18:34:21,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32782 to 21812. [2019-12-27 18:34:21,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21812 states. [2019-12-27 18:34:21,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21812 states to 21812 states and 66187 transitions. [2019-12-27 18:34:21,128 INFO L78 Accepts]: Start accepts. Automaton has 21812 states and 66187 transitions. Word has length 54 [2019-12-27 18:34:21,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:21,129 INFO L462 AbstractCegarLoop]: Abstraction has 21812 states and 66187 transitions. [2019-12-27 18:34:21,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:34:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 21812 states and 66187 transitions. [2019-12-27 18:34:21,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:34:21,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:21,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:21,158 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:34:21,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:21,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1027069858, now seen corresponding path program 2 times [2019-12-27 18:34:21,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:21,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821689691] [2019-12-27 18:34:21,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:21,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:34:21,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821689691] [2019-12-27 18:34:21,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:21,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 18:34:21,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [884072879] [2019-12-27 18:34:21,396 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:21,411 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:21,526 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 346 transitions. [2019-12-27 18:34:21,526 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:21,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:34:21,740 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:34:21,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:34:21,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:21,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:34:21,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:34:21,742 INFO L87 Difference]: Start difference. First operand 21812 states and 66187 transitions. Second operand 13 states. [2019-12-27 18:34:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:24,511 INFO L93 Difference]: Finished difference Result 28045 states and 83455 transitions. [2019-12-27 18:34:24,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 18:34:24,512 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 18:34:24,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:24,553 INFO L225 Difference]: With dead ends: 28045 [2019-12-27 18:34:24,553 INFO L226 Difference]: Without dead ends: 28045 [2019-12-27 18:34:24,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=255, Invalid=1227, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 18:34:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28045 states. [2019-12-27 18:34:24,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28045 to 19716. [2019-12-27 18:34:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19716 states. [2019-12-27 18:34:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19716 states to 19716 states and 60217 transitions. [2019-12-27 18:34:24,893 INFO L78 Accepts]: Start accepts. Automaton has 19716 states and 60217 transitions. Word has length 54 [2019-12-27 18:34:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:24,894 INFO L462 AbstractCegarLoop]: Abstraction has 19716 states and 60217 transitions. [2019-12-27 18:34:24,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:34:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 19716 states and 60217 transitions. [2019-12-27 18:34:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:34:24,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:24,913 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:24,913 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:34:24,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:24,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1391330862, now seen corresponding path program 3 times [2019-12-27 18:34:24,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:24,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311590203] [2019-12-27 18:34:24,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:34:25,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311590203] [2019-12-27 18:34:25,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:25,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 18:34:25,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [325838739] [2019-12-27 18:34:25,026 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:25,043 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:25,165 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 258 transitions. [2019-12-27 18:34:25,166 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:25,320 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 18:34:25,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:34:25,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:25,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:34:25,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:34:25,321 INFO L87 Difference]: Start difference. First operand 19716 states and 60217 transitions. Second operand 12 states. [2019-12-27 18:34:27,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:27,172 INFO L93 Difference]: Finished difference Result 35609 states and 108106 transitions. [2019-12-27 18:34:27,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 18:34:27,172 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-27 18:34:27,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:27,213 INFO L225 Difference]: With dead ends: 35609 [2019-12-27 18:34:27,213 INFO L226 Difference]: Without dead ends: 27951 [2019-12-27 18:34:27,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-12-27 18:34:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27951 states. [2019-12-27 18:34:27,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27951 to 20209. [2019-12-27 18:34:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20209 states. [2019-12-27 18:34:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20209 states to 20209 states and 61269 transitions. [2019-12-27 18:34:27,557 INFO L78 Accepts]: Start accepts. Automaton has 20209 states and 61269 transitions. Word has length 54 [2019-12-27 18:34:27,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:27,557 INFO L462 AbstractCegarLoop]: Abstraction has 20209 states and 61269 transitions. [2019-12-27 18:34:27,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:34:27,557 INFO L276 IsEmpty]: Start isEmpty. Operand 20209 states and 61269 transitions. [2019-12-27 18:34:27,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:34:27,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:27,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:27,581 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:34:27,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:27,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1496564564, now seen corresponding path program 4 times [2019-12-27 18:34:27,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:27,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489573553] [2019-12-27 18:34:27,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:34:27,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489573553] [2019-12-27 18:34:27,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:27,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 18:34:27,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [540109193] [2019-12-27 18:34:27,774 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:27,788 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:28,090 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 264 transitions. [2019-12-27 18:34:28,090 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:28,480 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 18:34:28,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 18:34:28,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:28,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 18:34:28,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-12-27 18:34:28,482 INFO L87 Difference]: Start difference. First operand 20209 states and 61269 transitions. Second operand 20 states. [2019-12-27 18:34:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:37,445 INFO L93 Difference]: Finished difference Result 83270 states and 246886 transitions. [2019-12-27 18:34:37,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-12-27 18:34:37,445 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-12-27 18:34:37,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:37,562 INFO L225 Difference]: With dead ends: 83270 [2019-12-27 18:34:37,562 INFO L226 Difference]: Without dead ends: 75520 [2019-12-27 18:34:37,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9103 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3168, Invalid=20394, Unknown=0, NotChecked=0, Total=23562 [2019-12-27 18:34:37,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75520 states. [2019-12-27 18:34:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75520 to 28566. [2019-12-27 18:34:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28566 states. [2019-12-27 18:34:38,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28566 states to 28566 states and 86085 transitions. [2019-12-27 18:34:38,540 INFO L78 Accepts]: Start accepts. Automaton has 28566 states and 86085 transitions. Word has length 54 [2019-12-27 18:34:38,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:38,540 INFO L462 AbstractCegarLoop]: Abstraction has 28566 states and 86085 transitions. [2019-12-27 18:34:38,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 18:34:38,541 INFO L276 IsEmpty]: Start isEmpty. Operand 28566 states and 86085 transitions. [2019-12-27 18:34:38,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:34:38,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:38,570 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:38,570 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:34:38,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:38,571 INFO L82 PathProgramCache]: Analyzing trace with hash -139497916, now seen corresponding path program 5 times [2019-12-27 18:34:38,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:38,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286375163] [2019-12-27 18:34:38,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:34:38,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286375163] [2019-12-27 18:34:38,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:38,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:34:38,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1131333703] [2019-12-27 18:34:38,632 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:38,645 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:38,799 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 179 states and 317 transitions. [2019-12-27 18:34:38,800 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:38,800 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:34:38,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:34:38,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:38,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:34:38,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:34:38,802 INFO L87 Difference]: Start difference. First operand 28566 states and 86085 transitions. Second operand 3 states. [2019-12-27 18:34:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:38,915 INFO L93 Difference]: Finished difference Result 28564 states and 86080 transitions. [2019-12-27 18:34:38,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:34:38,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 18:34:38,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:38,957 INFO L225 Difference]: With dead ends: 28564 [2019-12-27 18:34:38,957 INFO L226 Difference]: Without dead ends: 28564 [2019-12-27 18:34:38,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:34:39,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28564 states. [2019-12-27 18:34:39,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28564 to 26141. [2019-12-27 18:34:39,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26141 states. [2019-12-27 18:34:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26141 states to 26141 states and 79532 transitions. [2019-12-27 18:34:39,352 INFO L78 Accepts]: Start accepts. Automaton has 26141 states and 79532 transitions. Word has length 54 [2019-12-27 18:34:39,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:39,352 INFO L462 AbstractCegarLoop]: Abstraction has 26141 states and 79532 transitions. [2019-12-27 18:34:39,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:34:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 26141 states and 79532 transitions. [2019-12-27 18:34:39,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:34:39,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:39,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:39,382 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:34:39,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:39,382 INFO L82 PathProgramCache]: Analyzing trace with hash -2043347127, now seen corresponding path program 1 times [2019-12-27 18:34:39,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:39,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024695407] [2019-12-27 18:34:39,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:34:39,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024695407] [2019-12-27 18:34:39,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:39,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 18:34:39,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2037295852] [2019-12-27 18:34:39,881 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:39,908 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:40,124 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 215 states and 415 transitions. [2019-12-27 18:34:40,125 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:40,712 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 18:34:40,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 18:34:40,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:40,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 18:34:40,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:34:40,713 INFO L87 Difference]: Start difference. First operand 26141 states and 79532 transitions. Second operand 22 states. [2019-12-27 18:34:46,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:46,844 INFO L93 Difference]: Finished difference Result 48062 states and 144020 transitions. [2019-12-27 18:34:46,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 18:34:46,845 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 55 [2019-12-27 18:34:46,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:46,914 INFO L225 Difference]: With dead ends: 48062 [2019-12-27 18:34:46,915 INFO L226 Difference]: Without dead ends: 43553 [2019-12-27 18:34:46,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 12 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=574, Invalid=3086, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 18:34:47,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43553 states. [2019-12-27 18:34:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43553 to 26447. [2019-12-27 18:34:47,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26447 states. [2019-12-27 18:34:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26447 states to 26447 states and 80166 transitions. [2019-12-27 18:34:47,416 INFO L78 Accepts]: Start accepts. Automaton has 26447 states and 80166 transitions. Word has length 55 [2019-12-27 18:34:47,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:47,416 INFO L462 AbstractCegarLoop]: Abstraction has 26447 states and 80166 transitions. [2019-12-27 18:34:47,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 18:34:47,416 INFO L276 IsEmpty]: Start isEmpty. Operand 26447 states and 80166 transitions. [2019-12-27 18:34:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:34:47,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:47,443 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:47,443 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:34:47,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:47,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 2 times [2019-12-27 18:34:47,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:47,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653968830] [2019-12-27 18:34:47,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:34:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:34:47,566 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:34:47,566 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:34:47,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2345~0.base_24|) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2345~0.base_24| 4)) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t2345~0.base_24|) 0) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= (store .cse0 |v_ULTIMATE.start_main_~#t2345~0.base_24| 1) |v_#valid_59|) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2345~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2345~0.base_24|) |v_ULTIMATE.start_main_~#t2345~0.offset_18| 0)) |v_#memory_int_23|) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= 0 |v_ULTIMATE.start_main_~#t2345~0.offset_18|) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ULTIMATE.start_main_~#t2345~0.offset=|v_ULTIMATE.start_main_~#t2345~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t2347~0.base=|v_ULTIMATE.start_main_~#t2347~0.base_26|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_~#t2346~0.offset=|v_ULTIMATE.start_main_~#t2346~0.offset_19|, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_~#t2346~0.base=|v_ULTIMATE.start_main_~#t2346~0.base_26|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ULTIMATE.start_main_~#t2345~0.base=|v_ULTIMATE.start_main_~#t2345~0.base_24|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t2347~0.offset=|v_ULTIMATE.start_main_~#t2347~0.offset_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2345~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2347~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2346~0.offset, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_~#t2346~0.base, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t2345~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2347~0.offset, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 18:34:47,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2346~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2346~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2346~0.offset_11|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2346~0.base_13| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2346~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2346~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2346~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2346~0.base_13|) |v_ULTIMATE.start_main_~#t2346~0.offset_11| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2346~0.offset=|v_ULTIMATE.start_main_~#t2346~0.offset_11|, ULTIMATE.start_main_~#t2346~0.base=|v_ULTIMATE.start_main_~#t2346~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2346~0.offset, ULTIMATE.start_main_~#t2346~0.base] because there is no mapped edge [2019-12-27 18:34:47,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2347~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2347~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2347~0.base_13| 0)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2347~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2347~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2347~0.base_13|) |v_ULTIMATE.start_main_~#t2347~0.offset_11| 2)) |v_#memory_int_17|) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2347~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2347~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2347~0.base=|v_ULTIMATE.start_main_~#t2347~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t2347~0.offset=|v_ULTIMATE.start_main_~#t2347~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2347~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2347~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 18:34:47,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= ~x$w_buff1~0_Out-726154002 ~x$w_buff0~0_In-726154002) (= ~x$w_buff0~0_Out-726154002 1) (= ~x$w_buff0_used~0_In-726154002 ~x$w_buff1_used~0_Out-726154002) (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-726154002 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-726154002|) (= (mod ~x$w_buff1_used~0_Out-726154002 256) 0) (= P1Thread1of1ForFork0_~arg.offset_Out-726154002 |P1Thread1of1ForFork0_#in~arg.offset_In-726154002|) (= 1 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-726154002|) (= P1Thread1of1ForFork0_~arg.base_Out-726154002 |P1Thread1of1ForFork0_#in~arg.base_In-726154002|) (= ~x$w_buff0_used~0_Out-726154002 1)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-726154002, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-726154002|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-726154002|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-726154002} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-726154002, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-726154002, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-726154002, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-726154002, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-726154002|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-726154002|, ~x$w_buff1~0=~x$w_buff1~0_Out-726154002, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-726154002|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-726154002, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-726154002} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 18:34:47,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In209625130 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In209625130 256)))) (or (and (= ~x$w_buff1~0_In209625130 |P2Thread1of1ForFork1_#t~ite32_Out209625130|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In209625130 |P2Thread1of1ForFork1_#t~ite32_Out209625130|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In209625130, ~x$w_buff1_used~0=~x$w_buff1_used~0_In209625130, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In209625130, ~x~0=~x~0_In209625130} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out209625130|, ~x$w_buff1~0=~x$w_buff1~0_In209625130, ~x$w_buff1_used~0=~x$w_buff1_used~0_In209625130, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In209625130, ~x~0=~x~0_In209625130} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 18:34:47,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_29|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 18:34:47,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1380267654 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1380267654 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out-1380267654| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out-1380267654| ~x$w_buff0_used~0_In-1380267654) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1380267654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1380267654} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1380267654|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1380267654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1380267654} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 18:34:47,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-523381632 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-523381632 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-523381632|) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-523381632| ~x$w_buff0_used~0_In-523381632) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-523381632, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-523381632} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-523381632, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-523381632|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-523381632} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 18:34:47,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-545353124 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-545353124 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-545353124 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-545353124 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out-545353124| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out-545353124| ~x$w_buff1_used~0_In-545353124) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-545353124, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-545353124, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-545353124, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-545353124} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-545353124, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-545353124, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-545353124, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-545353124|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-545353124} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 18:34:47,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-826128903 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-826128903 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-826128903 ~x$r_buff0_thd2~0_Out-826128903)) (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-826128903)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-826128903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-826128903} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-826128903|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-826128903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-826128903} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 18:34:47,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-203709793 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-203709793 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-203709793 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-203709793 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-203709793| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite31_Out-203709793| ~x$r_buff1_thd2~0_In-203709793) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-203709793, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-203709793, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-203709793, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-203709793} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-203709793|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-203709793, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-203709793, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-203709793, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-203709793} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 18:34:47,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 18:34:47,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In204154491 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite12_Out204154491| ~x$w_buff1~0_In204154491) (= |P0Thread1of1ForFork2_#t~ite11_In204154491| |P0Thread1of1ForFork2_#t~ite11_Out204154491|) (not .cse0)) (and (= |P0Thread1of1ForFork2_#t~ite12_Out204154491| |P0Thread1of1ForFork2_#t~ite11_Out204154491|) .cse0 (= |P0Thread1of1ForFork2_#t~ite11_Out204154491| ~x$w_buff1~0_In204154491) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In204154491 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In204154491 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In204154491 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In204154491 256)))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In204154491, ~x$w_buff1~0=~x$w_buff1~0_In204154491, ~x$w_buff1_used~0=~x$w_buff1_used~0_In204154491, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In204154491, ~weak$$choice2~0=~weak$$choice2~0_In204154491, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In204154491|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In204154491} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In204154491, ~x$w_buff1~0=~x$w_buff1~0_In204154491, ~x$w_buff1_used~0=~x$w_buff1_used~0_In204154491, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In204154491, ~weak$$choice2~0=~weak$$choice2~0_In204154491, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out204154491|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out204154491|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In204154491} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 18:34:47,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1959456967 256)))) (or (and .cse0 (= ~x$w_buff0_used~0_In1959456967 |P0Thread1of1ForFork2_#t~ite14_Out1959456967|) (= |P0Thread1of1ForFork2_#t~ite15_Out1959456967| |P0Thread1of1ForFork2_#t~ite14_Out1959456967|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1959456967 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In1959456967 256)) .cse1) (= (mod ~x$w_buff0_used~0_In1959456967 256) 0) (and (= (mod ~x$w_buff1_used~0_In1959456967 256) 0) .cse1)))) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite15_Out1959456967| ~x$w_buff0_used~0_In1959456967) (= |P0Thread1of1ForFork2_#t~ite14_In1959456967| |P0Thread1of1ForFork2_#t~ite14_Out1959456967|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1959456967, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1959456967, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1959456967, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1959456967|, ~weak$$choice2~0=~weak$$choice2~0_In1959456967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1959456967} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1959456967, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1959456967, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1959456967|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1959456967, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1959456967|, ~weak$$choice2~0=~weak$$choice2~0_In1959456967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1959456967} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 18:34:47,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1655685917 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_In-1655685917| |P0Thread1of1ForFork2_#t~ite17_Out-1655685917|) (= ~x$w_buff1_used~0_In-1655685917 |P0Thread1of1ForFork2_#t~ite18_Out-1655685917|) (not .cse0)) (and (= |P0Thread1of1ForFork2_#t~ite18_Out-1655685917| |P0Thread1of1ForFork2_#t~ite17_Out-1655685917|) (= ~x$w_buff1_used~0_In-1655685917 |P0Thread1of1ForFork2_#t~ite17_Out-1655685917|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1655685917 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1655685917 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-1655685917 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1655685917 256) 0))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1655685917, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-1655685917|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1655685917, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1655685917, ~weak$$choice2~0=~weak$$choice2~0_In-1655685917, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1655685917} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1655685917, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-1655685917|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-1655685917|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1655685917, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1655685917, ~weak$$choice2~0=~weak$$choice2~0_In-1655685917, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1655685917} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 18:34:47,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite23_39| |v_P0Thread1of1ForFork2_#t~ite23_40|) (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_35|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (not (= 0 (mod v_~weak$$choice2~0_142 256))) (= |v_P0Thread1of1ForFork2_#t~ite22_36| |v_P0Thread1of1ForFork2_#t~ite22_35|)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_40|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_36|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_35|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_39|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_35|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 18:34:47,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 18:34:47,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1259087123 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1259087123 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1259087123 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-1259087123 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1259087123 |P2Thread1of1ForFork1_#t~ite35_Out-1259087123|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-1259087123|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1259087123, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1259087123, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1259087123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1259087123} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1259087123|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1259087123, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1259087123, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1259087123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1259087123} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 18:34:47,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-253737444 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-253737444 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-253737444| ~x$r_buff0_thd3~0_In-253737444) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-253737444| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-253737444, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-253737444} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-253737444|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-253737444, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-253737444} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 18:34:47,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1298847231 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-1298847231 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-1298847231 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1298847231 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out-1298847231| 0)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out-1298847231| ~x$r_buff1_thd3~0_In-1298847231) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1298847231, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1298847231, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1298847231, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1298847231} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1298847231|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1298847231, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1298847231, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1298847231, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1298847231} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 18:34:47,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_40|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_39|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 18:34:47,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= 3 v_~__unbuffered_cnt~0_39) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:34:47,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-21520681 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-21520681 256)))) (or (and (= ~x~0_In-21520681 |ULTIMATE.start_main_#t~ite41_Out-21520681|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-21520681| ~x$w_buff1~0_In-21520681)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-21520681, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-21520681, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-21520681, ~x~0=~x~0_In-21520681} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-21520681|, ~x$w_buff1~0=~x$w_buff1~0_In-21520681, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-21520681, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-21520681, ~x~0=~x~0_In-21520681} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 18:34:47,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 18:34:47,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-554461222 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-554461222 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-554461222| ~x$w_buff0_used~0_In-554461222) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-554461222| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-554461222, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-554461222} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-554461222, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-554461222|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-554461222} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 18:34:47,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1247152071 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1247152071 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1247152071 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1247152071 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1247152071| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1247152071| ~x$w_buff1_used~0_In-1247152071)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1247152071, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1247152071, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1247152071, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1247152071} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1247152071, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1247152071, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1247152071, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1247152071|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1247152071} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 18:34:47,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1913502283 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1913502283 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1913502283| ~x$r_buff0_thd0~0_In1913502283)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1913502283| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1913502283, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1913502283} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1913502283, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1913502283|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1913502283} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 18:34:47,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1676706779 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1676706779 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1676706779 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1676706779 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out1676706779|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In1676706779 |ULTIMATE.start_main_#t~ite46_Out1676706779|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1676706779, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1676706779, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1676706779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1676706779} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1676706779, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1676706779|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1676706779, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1676706779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1676706779} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 18:34:47,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:34:47,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:34:47 BasicIcfg [2019-12-27 18:34:47,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:34:47,712 INFO L168 Benchmark]: Toolchain (without parser) took 106024.98 ms. Allocated memory was 137.4 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 100.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 18:34:47,712 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 18:34:47,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.47 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 99.8 MB in the beginning and 156.3 MB in the end (delta: -56.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:34:47,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.01 ms. Allocated memory is still 202.4 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:34:47,714 INFO L168 Benchmark]: Boogie Preprocessor took 56.25 ms. Allocated memory is still 202.4 MB. Free memory was 153.6 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:34:47,715 INFO L168 Benchmark]: RCFGBuilder took 856.00 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 104.7 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-27 18:34:47,715 INFO L168 Benchmark]: TraceAbstraction took 104238.97 ms. Allocated memory was 202.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 104.0 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 18:34:47,717 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 792.47 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 99.8 MB in the beginning and 156.3 MB in the end (delta: -56.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.01 ms. Allocated memory is still 202.4 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.25 ms. Allocated memory is still 202.4 MB. Free memory was 153.6 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 856.00 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 104.7 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 104238.97 ms. Allocated memory was 202.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 104.0 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 103.9s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 51.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5456 SDtfs, 10447 SDslu, 23567 SDs, 0 SdLazy, 23278 SolverSat, 736 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 809 GetRequests, 186 SyntacticMatches, 98 SemanticMatches, 525 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12459 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 24.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 277230 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 988 NumberOfCodeBlocks, 988 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 911 ConstructedInterpolants, 0 QuantifiedInterpolants, 167250 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...