/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:16:05,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:16:05,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:16:05,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:16:05,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:16:05,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:16:05,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:16:05,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:16:05,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:16:05,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:16:05,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:16:05,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:16:05,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:16:05,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:16:05,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:16:05,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:16:05,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:16:05,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:16:05,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:16:05,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:16:05,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:16:05,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:16:05,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:16:05,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:16:05,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:16:05,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:16:05,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:16:05,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:16:05,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:16:05,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:16:05,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:16:05,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:16:05,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:16:05,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:16:05,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:16:05,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:16:05,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:16:05,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:16:05,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:16:05,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:16:05,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:16:05,454 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-VariableLbe-MCR.epf [2019-12-27 22:16:05,469 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:16:05,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:16:05,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:16:05,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:16:05,471 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:16:05,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:16:05,471 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:16:05,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:16:05,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:16:05,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:16:05,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:16:05,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:16:05,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:16:05,473 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:16:05,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:16:05,473 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:16:05,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:16:05,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:16:05,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:16:05,474 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:16:05,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:16:05,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:16:05,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:16:05,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:16:05,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:16:05,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:16:05,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:16:05,475 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:16:05,476 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:16:05,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:16:05,476 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:16:05,476 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:16:05,764 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:16:05,777 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:16:05,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:16:05,783 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:16:05,783 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:16:05,785 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2019-12-27 22:16:05,848 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4571e5ae4/3f8cac40dcd84bcaadb9d587ec7b5698/FLAG25b4891c4 [2019-12-27 22:16:06,419 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:16:06,420 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2019-12-27 22:16:06,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4571e5ae4/3f8cac40dcd84bcaadb9d587ec7b5698/FLAG25b4891c4 [2019-12-27 22:16:06,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4571e5ae4/3f8cac40dcd84bcaadb9d587ec7b5698 [2019-12-27 22:16:06,732 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:16:06,734 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:16:06,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:16:06,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:16:06,739 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:16:06,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:16:06" (1/1) ... [2019-12-27 22:16:06,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@470b9204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:06, skipping insertion in model container [2019-12-27 22:16:06,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:16:06" (1/1) ... [2019-12-27 22:16:06,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:16:06,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:16:07,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:16:07,411 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:16:07,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:16:07,548 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:16:07,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:07 WrapperNode [2019-12-27 22:16:07,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:16:07,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:16:07,550 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:16:07,550 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:16:07,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:07" (1/1) ... [2019-12-27 22:16:07,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:07" (1/1) ... [2019-12-27 22:16:07,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:16:07,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:16:07,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:16:07,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:16:07,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:07" (1/1) ... [2019-12-27 22:16:07,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:07" (1/1) ... [2019-12-27 22:16:07,638 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:07" (1/1) ... [2019-12-27 22:16:07,638 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:07" (1/1) ... [2019-12-27 22:16:07,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:07" (1/1) ... [2019-12-27 22:16:07,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:07" (1/1) ... [2019-12-27 22:16:07,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:07" (1/1) ... [2019-12-27 22:16:07,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:16:07,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:16:07,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:16:07,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:16:07,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:07" (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 22:16:07,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:16:07,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:16:07,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:16:07,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:16:07,726 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:16:07,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:16:07,726 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:16:07,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:16:07,727 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:16:07,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:16:07,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:16:07,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:16:07,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:16:07,729 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 22:16:08,488 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:16:08,488 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:16:08,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:16:08 BoogieIcfgContainer [2019-12-27 22:16:08,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:16:08,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:16:08,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:16:08,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:16:08,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:16:06" (1/3) ... [2019-12-27 22:16:08,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eda50b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:16:08, skipping insertion in model container [2019-12-27 22:16:08,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:07" (2/3) ... [2019-12-27 22:16:08,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eda50b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:16:08, skipping insertion in model container [2019-12-27 22:16:08,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:16:08" (3/3) ... [2019-12-27 22:16:08,498 INFO L109 eAbstractionObserver]: Analyzing ICFG safe004_rmo.opt.i [2019-12-27 22:16:08,508 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:16:08,508 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:16:08,516 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:16:08,517 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:16:08,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,558 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,558 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,567 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,567 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,568 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,568 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,568 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,594 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,594 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,605 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,605 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,607 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,608 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,608 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,612 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,613 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:08,626 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:16:08,646 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:16:08,646 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:16:08,646 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:16:08,646 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:16:08,646 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:16:08,647 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:16:08,647 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:16:08,647 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:16:08,664 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 22:16:08,666 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 22:16:08,768 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 22:16:08,769 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:16:08,784 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:16:08,808 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 22:16:08,860 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 22:16:08,860 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:16:08,867 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:16:08,887 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 22:16:08,888 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:16:12,169 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 22:16:12,298 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 22:16:12,331 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82010 [2019-12-27 22:16:12,331 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 22:16:12,336 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 109 transitions [2019-12-27 22:16:31,619 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 117808 states. [2019-12-27 22:16:31,621 INFO L276 IsEmpty]: Start isEmpty. Operand 117808 states. [2019-12-27 22:16:31,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:16:31,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:16:31,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:16:31,629 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:16:31,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:16:31,635 INFO L82 PathProgramCache]: Analyzing trace with hash 806008766, now seen corresponding path program 1 times [2019-12-27 22:16:31,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:16:31,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843124683] [2019-12-27 22:16:31,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:16:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:16:31,880 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 22:16:31,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843124683] [2019-12-27 22:16:31,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:16:31,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:16:31,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [5650699] [2019-12-27 22:16:31,884 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:16:31,889 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:16:31,902 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:16:31,903 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:16:31,907 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:16:31,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:16:31,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:16:31,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:16:31,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:16:31,926 INFO L87 Difference]: Start difference. First operand 117808 states. Second operand 3 states. [2019-12-27 22:16:32,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:16:32,982 INFO L93 Difference]: Finished difference Result 117244 states and 506404 transitions. [2019-12-27 22:16:32,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:16:32,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:16:32,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:16:36,730 INFO L225 Difference]: With dead ends: 117244 [2019-12-27 22:16:36,731 INFO L226 Difference]: Without dead ends: 114878 [2019-12-27 22:16:36,732 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 22:16:40,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114878 states. [2019-12-27 22:16:43,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114878 to 114878. [2019-12-27 22:16:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114878 states. [2019-12-27 22:16:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114878 states to 114878 states and 496758 transitions. [2019-12-27 22:16:43,488 INFO L78 Accepts]: Start accepts. Automaton has 114878 states and 496758 transitions. Word has length 5 [2019-12-27 22:16:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:16:43,488 INFO L462 AbstractCegarLoop]: Abstraction has 114878 states and 496758 transitions. [2019-12-27 22:16:43,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:16:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 114878 states and 496758 transitions. [2019-12-27 22:16:43,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:16:43,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:16:43,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:16:43,492 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:16:43,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:16:43,493 INFO L82 PathProgramCache]: Analyzing trace with hash 702926397, now seen corresponding path program 1 times [2019-12-27 22:16:43,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:16:43,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633745148] [2019-12-27 22:16:43,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:16:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:16:43,644 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 22:16:43,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633745148] [2019-12-27 22:16:43,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:16:43,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:16:43,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1623559720] [2019-12-27 22:16:43,645 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:16:43,646 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:16:43,651 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 22:16:43,651 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:16:43,653 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:16:43,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:16:43,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:16:43,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:16:43,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:16:43,655 INFO L87 Difference]: Start difference. First operand 114878 states and 496758 transitions. Second operand 4 states. [2019-12-27 22:16:49,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:16:49,024 INFO L93 Difference]: Finished difference Result 184188 states and 760222 transitions. [2019-12-27 22:16:49,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:16:49,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:16:49,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:16:49,628 INFO L225 Difference]: With dead ends: 184188 [2019-12-27 22:16:49,628 INFO L226 Difference]: Without dead ends: 184139 [2019-12-27 22:16:49,629 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 22:16:58,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184139 states. [2019-12-27 22:17:01,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184139 to 169203. [2019-12-27 22:17:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169203 states. [2019-12-27 22:17:08,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169203 states to 169203 states and 707190 transitions. [2019-12-27 22:17:08,198 INFO L78 Accepts]: Start accepts. Automaton has 169203 states and 707190 transitions. Word has length 11 [2019-12-27 22:17:08,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:08,199 INFO L462 AbstractCegarLoop]: Abstraction has 169203 states and 707190 transitions. [2019-12-27 22:17:08,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:17:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 169203 states and 707190 transitions. [2019-12-27 22:17:08,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:17:08,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:08,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:08,208 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:08,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:08,209 INFO L82 PathProgramCache]: Analyzing trace with hash 702866747, now seen corresponding path program 1 times [2019-12-27 22:17:08,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:08,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655176176] [2019-12-27 22:17:08,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:08,284 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 22:17:08,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655176176] [2019-12-27 22:17:08,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:08,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:17:08,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2040490750] [2019-12-27 22:17:08,286 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:08,288 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:08,290 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:17:08,290 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:08,290 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:17:08,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:17:08,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:08,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:17:08,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:17:08,291 INFO L87 Difference]: Start difference. First operand 169203 states and 707190 transitions. Second operand 4 states. [2019-12-27 22:17:09,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:09,785 INFO L93 Difference]: Finished difference Result 240014 states and 977713 transitions. [2019-12-27 22:17:09,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:17:09,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:17:09,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:12,395 INFO L225 Difference]: With dead ends: 240014 [2019-12-27 22:17:12,395 INFO L226 Difference]: Without dead ends: 239951 [2019-12-27 22:17:12,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 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 22:17:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239951 states. [2019-12-27 22:17:27,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239951 to 203645. [2019-12-27 22:17:27,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203645 states. [2019-12-27 22:17:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203645 states to 203645 states and 844323 transitions. [2019-12-27 22:17:28,281 INFO L78 Accepts]: Start accepts. Automaton has 203645 states and 844323 transitions. Word has length 13 [2019-12-27 22:17:28,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:28,282 INFO L462 AbstractCegarLoop]: Abstraction has 203645 states and 844323 transitions. [2019-12-27 22:17:28,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:17:28,282 INFO L276 IsEmpty]: Start isEmpty. Operand 203645 states and 844323 transitions. [2019-12-27 22:17:28,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:17:28,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:28,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:28,287 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:28,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:28,287 INFO L82 PathProgramCache]: Analyzing trace with hash 464803757, now seen corresponding path program 1 times [2019-12-27 22:17:28,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:28,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660316777] [2019-12-27 22:17:28,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:28,348 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 22:17:28,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660316777] [2019-12-27 22:17:28,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:28,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:17:28,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1944152708] [2019-12-27 22:17:28,349 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:28,351 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:28,352 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:17:28,352 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:28,353 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:17:28,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:17:28,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:28,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:17:28,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:17:28,354 INFO L87 Difference]: Start difference. First operand 203645 states and 844323 transitions. Second operand 3 states. [2019-12-27 22:17:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:28,507 INFO L93 Difference]: Finished difference Result 39928 states and 130360 transitions. [2019-12-27 22:17:28,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:17:28,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:17:28,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:28,579 INFO L225 Difference]: With dead ends: 39928 [2019-12-27 22:17:28,579 INFO L226 Difference]: Without dead ends: 39928 [2019-12-27 22:17:28,579 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 22:17:28,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39928 states. [2019-12-27 22:17:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39928 to 39928. [2019-12-27 22:17:35,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39928 states. [2019-12-27 22:17:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39928 states to 39928 states and 130360 transitions. [2019-12-27 22:17:35,169 INFO L78 Accepts]: Start accepts. Automaton has 39928 states and 130360 transitions. Word has length 13 [2019-12-27 22:17:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:35,170 INFO L462 AbstractCegarLoop]: Abstraction has 39928 states and 130360 transitions. [2019-12-27 22:17:35,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:17:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 39928 states and 130360 transitions. [2019-12-27 22:17:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:17:35,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:35,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:35,173 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:35,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:35,174 INFO L82 PathProgramCache]: Analyzing trace with hash -2009264966, now seen corresponding path program 1 times [2019-12-27 22:17:35,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:35,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000250166] [2019-12-27 22:17:35,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:35,300 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 22:17:35,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000250166] [2019-12-27 22:17:35,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:35,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:17:35,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2050895204] [2019-12-27 22:17:35,301 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:35,304 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:35,309 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 77 transitions. [2019-12-27 22:17:35,309 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:35,310 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:17:35,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:17:35,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:35,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:17:35,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:17:35,311 INFO L87 Difference]: Start difference. First operand 39928 states and 130360 transitions. Second operand 5 states. [2019-12-27 22:17:36,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:36,161 INFO L93 Difference]: Finished difference Result 53752 states and 171521 transitions. [2019-12-27 22:17:36,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:17:36,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 22:17:36,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:36,249 INFO L225 Difference]: With dead ends: 53752 [2019-12-27 22:17:36,250 INFO L226 Difference]: Without dead ends: 53739 [2019-12-27 22:17:36,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:17:36,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53739 states. [2019-12-27 22:17:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53739 to 40157. [2019-12-27 22:17:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40157 states. [2019-12-27 22:17:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40157 states to 40157 states and 130977 transitions. [2019-12-27 22:17:37,478 INFO L78 Accepts]: Start accepts. Automaton has 40157 states and 130977 transitions. Word has length 19 [2019-12-27 22:17:37,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:37,478 INFO L462 AbstractCegarLoop]: Abstraction has 40157 states and 130977 transitions. [2019-12-27 22:17:37,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:17:37,478 INFO L276 IsEmpty]: Start isEmpty. Operand 40157 states and 130977 transitions. [2019-12-27 22:17:37,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:17:37,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:37,490 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 22:17:37,490 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:37,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:37,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1059595659, now seen corresponding path program 1 times [2019-12-27 22:17:37,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:37,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956242451] [2019-12-27 22:17:37,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:37,597 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 22:17:37,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956242451] [2019-12-27 22:17:37,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:37,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:17:37,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1001614977] [2019-12-27 22:17:37,601 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:37,604 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:37,618 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 121 transitions. [2019-12-27 22:17:37,618 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:37,685 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:17:37,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:17:37,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:37,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:17:37,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:17:37,686 INFO L87 Difference]: Start difference. First operand 40157 states and 130977 transitions. Second operand 6 states. [2019-12-27 22:17:37,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:37,744 INFO L93 Difference]: Finished difference Result 7224 states and 19739 transitions. [2019-12-27 22:17:37,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:17:37,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 22:17:37,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:37,755 INFO L225 Difference]: With dead ends: 7224 [2019-12-27 22:17:37,755 INFO L226 Difference]: Without dead ends: 7224 [2019-12-27 22:17:37,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:17:37,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2019-12-27 22:17:37,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 7112. [2019-12-27 22:17:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7112 states. [2019-12-27 22:17:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7112 states to 7112 states and 19419 transitions. [2019-12-27 22:17:37,846 INFO L78 Accepts]: Start accepts. Automaton has 7112 states and 19419 transitions. Word has length 25 [2019-12-27 22:17:37,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:37,846 INFO L462 AbstractCegarLoop]: Abstraction has 7112 states and 19419 transitions. [2019-12-27 22:17:37,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:17:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 7112 states and 19419 transitions. [2019-12-27 22:17:37,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 22:17:37,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:37,857 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] [2019-12-27 22:17:37,857 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:37,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:37,858 INFO L82 PathProgramCache]: Analyzing trace with hash -81356198, now seen corresponding path program 1 times [2019-12-27 22:17:37,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:37,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230731303] [2019-12-27 22:17:37,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:37,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 22:17:37,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230731303] [2019-12-27 22:17:37,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:37,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:17:37,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [20671338] [2019-12-27 22:17:37,935 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:37,942 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:37,970 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 125 transitions. [2019-12-27 22:17:37,970 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:37,971 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:17:37,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:17:37,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:37,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:17:37,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:17:37,972 INFO L87 Difference]: Start difference. First operand 7112 states and 19419 transitions. Second operand 5 states. [2019-12-27 22:17:38,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:38,016 INFO L93 Difference]: Finished difference Result 5025 states and 14423 transitions. [2019-12-27 22:17:38,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:17:38,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 22:17:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:38,025 INFO L225 Difference]: With dead ends: 5025 [2019-12-27 22:17:38,025 INFO L226 Difference]: Without dead ends: 5025 [2019-12-27 22:17:38,025 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 22:17:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2019-12-27 22:17:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4661. [2019-12-27 22:17:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-12-27 22:17:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 13439 transitions. [2019-12-27 22:17:38,099 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 13439 transitions. Word has length 37 [2019-12-27 22:17:38,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:38,100 INFO L462 AbstractCegarLoop]: Abstraction has 4661 states and 13439 transitions. [2019-12-27 22:17:38,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:17:38,100 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 13439 transitions. [2019-12-27 22:17:38,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:17:38,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:38,109 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:38,110 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:38,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:38,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2136434843, now seen corresponding path program 1 times [2019-12-27 22:17:38,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:38,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336868961] [2019-12-27 22:17:38,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:38,184 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 22:17:38,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336868961] [2019-12-27 22:17:38,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:38,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:17:38,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1882809545] [2019-12-27 22:17:38,186 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:38,211 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:38,356 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 285 transitions. [2019-12-27 22:17:38,356 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:38,358 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:17:38,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:17:38,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:38,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:17:38,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:17:38,359 INFO L87 Difference]: Start difference. First operand 4661 states and 13439 transitions. Second operand 3 states. [2019-12-27 22:17:38,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:38,421 INFO L93 Difference]: Finished difference Result 4670 states and 13453 transitions. [2019-12-27 22:17:38,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:17:38,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:17:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:38,430 INFO L225 Difference]: With dead ends: 4670 [2019-12-27 22:17:38,430 INFO L226 Difference]: Without dead ends: 4670 [2019-12-27 22:17:38,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 22:17:38,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-27 22:17:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-27 22:17:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 22:17:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13449 transitions. [2019-12-27 22:17:38,497 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13449 transitions. Word has length 65 [2019-12-27 22:17:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:38,498 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13449 transitions. [2019-12-27 22:17:38,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:17:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13449 transitions. [2019-12-27 22:17:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:17:38,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:38,506 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:38,506 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:38,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:38,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1287100776, now seen corresponding path program 1 times [2019-12-27 22:17:38,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:38,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114103153] [2019-12-27 22:17:38,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:38,583 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 22:17:38,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114103153] [2019-12-27 22:17:38,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:38,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:17:38,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [128709626] [2019-12-27 22:17:38,584 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:38,604 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:38,709 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 285 transitions. [2019-12-27 22:17:38,709 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:38,711 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:17:38,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:17:38,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:38,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:17:38,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:17:38,712 INFO L87 Difference]: Start difference. First operand 4666 states and 13449 transitions. Second operand 3 states. [2019-12-27 22:17:38,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:38,775 INFO L93 Difference]: Finished difference Result 4670 states and 13443 transitions. [2019-12-27 22:17:38,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:17:38,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:17:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:38,781 INFO L225 Difference]: With dead ends: 4670 [2019-12-27 22:17:38,782 INFO L226 Difference]: Without dead ends: 4670 [2019-12-27 22:17:38,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 22:17:38,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-27 22:17:38,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-27 22:17:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 22:17:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13439 transitions. [2019-12-27 22:17:38,844 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13439 transitions. Word has length 65 [2019-12-27 22:17:38,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:38,845 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13439 transitions. [2019-12-27 22:17:38,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:17:38,845 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13439 transitions. [2019-12-27 22:17:38,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:17:38,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:38,852 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:38,852 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:38,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:38,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1294757063, now seen corresponding path program 1 times [2019-12-27 22:17:38,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:38,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426475022] [2019-12-27 22:17:38,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:38,967 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 22:17:38,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426475022] [2019-12-27 22:17:38,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:38,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:17:38,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [802451794] [2019-12-27 22:17:38,969 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:38,988 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:39,289 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 285 transitions. [2019-12-27 22:17:39,289 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:39,405 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 22:17:39,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:17:39,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:39,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:17:39,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:17:39,406 INFO L87 Difference]: Start difference. First operand 4666 states and 13439 transitions. Second operand 10 states. [2019-12-27 22:17:40,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:40,514 INFO L93 Difference]: Finished difference Result 11533 states and 33214 transitions. [2019-12-27 22:17:40,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:17:40,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 22:17:40,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:40,533 INFO L225 Difference]: With dead ends: 11533 [2019-12-27 22:17:40,533 INFO L226 Difference]: Without dead ends: 11533 [2019-12-27 22:17:40,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2019-12-27 22:17:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11533 states. [2019-12-27 22:17:40,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11533 to 5494. [2019-12-27 22:17:40,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5494 states. [2019-12-27 22:17:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5494 states to 5494 states and 15891 transitions. [2019-12-27 22:17:40,699 INFO L78 Accepts]: Start accepts. Automaton has 5494 states and 15891 transitions. Word has length 65 [2019-12-27 22:17:40,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:40,700 INFO L462 AbstractCegarLoop]: Abstraction has 5494 states and 15891 transitions. [2019-12-27 22:17:40,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:17:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 5494 states and 15891 transitions. [2019-12-27 22:17:40,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:17:40,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:40,711 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:40,711 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:40,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:40,711 INFO L82 PathProgramCache]: Analyzing trace with hash -2057570235, now seen corresponding path program 2 times [2019-12-27 22:17:40,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:40,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705571675] [2019-12-27 22:17:40,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:40,840 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 22:17:40,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705571675] [2019-12-27 22:17:40,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:40,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:17:40,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1102031479] [2019-12-27 22:17:40,841 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:40,875 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:41,009 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 241 transitions. [2019-12-27 22:17:41,009 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:41,039 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:17:41,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:17:41,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:41,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:17:41,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:17:41,040 INFO L87 Difference]: Start difference. First operand 5494 states and 15891 transitions. Second operand 6 states. [2019-12-27 22:17:41,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:41,541 INFO L93 Difference]: Finished difference Result 8990 states and 25758 transitions. [2019-12-27 22:17:41,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:17:41,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 22:17:41,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:41,554 INFO L225 Difference]: With dead ends: 8990 [2019-12-27 22:17:41,554 INFO L226 Difference]: Without dead ends: 8990 [2019-12-27 22:17:41,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:17:41,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8990 states. [2019-12-27 22:17:41,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8990 to 5996. [2019-12-27 22:17:41,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5996 states. [2019-12-27 22:17:41,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5996 states to 5996 states and 17383 transitions. [2019-12-27 22:17:41,654 INFO L78 Accepts]: Start accepts. Automaton has 5996 states and 17383 transitions. Word has length 65 [2019-12-27 22:17:41,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:41,654 INFO L462 AbstractCegarLoop]: Abstraction has 5996 states and 17383 transitions. [2019-12-27 22:17:41,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:17:41,654 INFO L276 IsEmpty]: Start isEmpty. Operand 5996 states and 17383 transitions. [2019-12-27 22:17:41,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:17:41,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:41,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:41,663 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:41,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1243942585, now seen corresponding path program 3 times [2019-12-27 22:17:41,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:41,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512689709] [2019-12-27 22:17:41,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:41,739 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 22:17:41,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512689709] [2019-12-27 22:17:41,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:41,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:17:41,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1264081377] [2019-12-27 22:17:41,740 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:41,759 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:42,162 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 386 transitions. [2019-12-27 22:17:42,163 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:42,191 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:17:42,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:17:42,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:42,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:17:42,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:17:42,195 INFO L87 Difference]: Start difference. First operand 5996 states and 17383 transitions. Second operand 5 states. [2019-12-27 22:17:42,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:42,414 INFO L93 Difference]: Finished difference Result 6126 states and 17446 transitions. [2019-12-27 22:17:42,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:17:42,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 22:17:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:42,424 INFO L225 Difference]: With dead ends: 6126 [2019-12-27 22:17:42,424 INFO L226 Difference]: Without dead ends: 6126 [2019-12-27 22:17:42,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:17:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6126 states. [2019-12-27 22:17:42,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6126 to 4950. [2019-12-27 22:17:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4950 states. [2019-12-27 22:17:42,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 14080 transitions. [2019-12-27 22:17:42,499 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 14080 transitions. Word has length 65 [2019-12-27 22:17:42,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:42,499 INFO L462 AbstractCegarLoop]: Abstraction has 4950 states and 14080 transitions. [2019-12-27 22:17:42,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:17:42,499 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 14080 transitions. [2019-12-27 22:17:42,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:17:42,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:42,507 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:42,507 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:42,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:42,508 INFO L82 PathProgramCache]: Analyzing trace with hash -930835965, now seen corresponding path program 1 times [2019-12-27 22:17:42,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:42,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617595626] [2019-12-27 22:17:42,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:42,699 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 22:17:42,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617595626] [2019-12-27 22:17:42,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:42,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:17:42,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [582275243] [2019-12-27 22:17:42,700 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:42,719 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:42,871 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 351 transitions. [2019-12-27 22:17:42,872 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:42,914 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:17:42,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:17:42,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:42,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:17:42,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:17:42,915 INFO L87 Difference]: Start difference. First operand 4950 states and 14080 transitions. Second operand 8 states. [2019-12-27 22:17:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:43,339 INFO L93 Difference]: Finished difference Result 17012 states and 48683 transitions. [2019-12-27 22:17:43,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 22:17:43,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 22:17:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:43,356 INFO L225 Difference]: With dead ends: 17012 [2019-12-27 22:17:43,356 INFO L226 Difference]: Without dead ends: 10215 [2019-12-27 22:17:43,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-27 22:17:43,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10215 states. [2019-12-27 22:17:43,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10215 to 4950. [2019-12-27 22:17:43,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4950 states. [2019-12-27 22:17:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 14015 transitions. [2019-12-27 22:17:43,493 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 14015 transitions. Word has length 66 [2019-12-27 22:17:43,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:43,493 INFO L462 AbstractCegarLoop]: Abstraction has 4950 states and 14015 transitions. [2019-12-27 22:17:43,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:17:43,493 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 14015 transitions. [2019-12-27 22:17:43,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:17:43,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:43,500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:43,500 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:43,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:43,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1676100569, now seen corresponding path program 2 times [2019-12-27 22:17:43,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:43,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52764019] [2019-12-27 22:17:43,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:43,608 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 22:17:43,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52764019] [2019-12-27 22:17:43,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:43,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:17:43,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2031392196] [2019-12-27 22:17:43,609 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:43,627 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:43,769 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 351 transitions. [2019-12-27 22:17:43,770 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:43,799 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:17:43,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:17:43,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:43,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:17:43,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:17:43,800 INFO L87 Difference]: Start difference. First operand 4950 states and 14015 transitions. Second operand 7 states. [2019-12-27 22:17:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:43,953 INFO L93 Difference]: Finished difference Result 8685 states and 24629 transitions. [2019-12-27 22:17:43,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:17:43,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 22:17:43,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:43,961 INFO L225 Difference]: With dead ends: 8685 [2019-12-27 22:17:43,962 INFO L226 Difference]: Without dead ends: 3982 [2019-12-27 22:17:43,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:17:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3982 states. [2019-12-27 22:17:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3982 to 3292. [2019-12-27 22:17:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3292 states. [2019-12-27 22:17:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 9258 transitions. [2019-12-27 22:17:44,050 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 9258 transitions. Word has length 66 [2019-12-27 22:17:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:44,051 INFO L462 AbstractCegarLoop]: Abstraction has 3292 states and 9258 transitions. [2019-12-27 22:17:44,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:17:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 9258 transitions. [2019-12-27 22:17:44,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:17:44,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:44,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:44,058 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:44,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:44,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1577722343, now seen corresponding path program 3 times [2019-12-27 22:17:44,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:44,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451584883] [2019-12-27 22:17:44,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:44,184 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 22:17:44,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451584883] [2019-12-27 22:17:44,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:44,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:17:44,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [152188463] [2019-12-27 22:17:44,186 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:44,205 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:44,518 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 245 transitions. [2019-12-27 22:17:44,519 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:44,583 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 22:17:44,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:17:44,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:44,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:17:44,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:17:44,584 INFO L87 Difference]: Start difference. First operand 3292 states and 9258 transitions. Second operand 5 states. [2019-12-27 22:17:44,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:44,926 INFO L93 Difference]: Finished difference Result 5305 states and 14820 transitions. [2019-12-27 22:17:44,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:17:44,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 22:17:44,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:44,935 INFO L225 Difference]: With dead ends: 5305 [2019-12-27 22:17:44,935 INFO L226 Difference]: Without dead ends: 5305 [2019-12-27 22:17:44,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 10 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:17:44,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5305 states. [2019-12-27 22:17:45,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5305 to 4060. [2019-12-27 22:17:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-12-27 22:17:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 11459 transitions. [2019-12-27 22:17:45,031 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 11459 transitions. Word has length 66 [2019-12-27 22:17:45,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:45,032 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 11459 transitions. [2019-12-27 22:17:45,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:17:45,032 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 11459 transitions. [2019-12-27 22:17:45,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:17:45,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:45,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:45,041 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:45,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:45,041 INFO L82 PathProgramCache]: Analyzing trace with hash -41780101, now seen corresponding path program 4 times [2019-12-27 22:17:45,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:45,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951877670] [2019-12-27 22:17:45,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:45,164 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 22:17:45,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951877670] [2019-12-27 22:17:45,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:45,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:17:45,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [915186156] [2019-12-27 22:17:45,166 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:45,184 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:45,310 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 244 transitions. [2019-12-27 22:17:45,310 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:45,311 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:17:45,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:17:45,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:45,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:17:45,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:17:45,312 INFO L87 Difference]: Start difference. First operand 4060 states and 11459 transitions. Second operand 7 states. [2019-12-27 22:17:45,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:45,420 INFO L93 Difference]: Finished difference Result 8124 states and 23139 transitions. [2019-12-27 22:17:45,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:17:45,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 22:17:45,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:45,427 INFO L225 Difference]: With dead ends: 8124 [2019-12-27 22:17:45,427 INFO L226 Difference]: Without dead ends: 4135 [2019-12-27 22:17:45,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:17:45,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4135 states. [2019-12-27 22:17:45,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4135 to 3444. [2019-12-27 22:17:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3444 states. [2019-12-27 22:17:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 3444 states and 9768 transitions. [2019-12-27 22:17:45,504 INFO L78 Accepts]: Start accepts. Automaton has 3444 states and 9768 transitions. Word has length 66 [2019-12-27 22:17:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:45,504 INFO L462 AbstractCegarLoop]: Abstraction has 3444 states and 9768 transitions. [2019-12-27 22:17:45,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:17:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3444 states and 9768 transitions. [2019-12-27 22:17:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:17:45,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:45,511 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:45,511 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:45,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:45,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1242256403, now seen corresponding path program 5 times [2019-12-27 22:17:45,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:45,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161864911] [2019-12-27 22:17:45,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:45,566 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 22:17:45,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161864911] [2019-12-27 22:17:45,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:45,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:17:45,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1407337132] [2019-12-27 22:17:45,567 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:45,583 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:45,688 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 236 transitions. [2019-12-27 22:17:45,688 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:45,689 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:17:45,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:17:45,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:45,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:17:45,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:17:45,690 INFO L87 Difference]: Start difference. First operand 3444 states and 9768 transitions. Second operand 3 states. [2019-12-27 22:17:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:45,716 INFO L93 Difference]: Finished difference Result 2673 states and 7355 transitions. [2019-12-27 22:17:45,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:17:45,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 22:17:45,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:45,719 INFO L225 Difference]: With dead ends: 2673 [2019-12-27 22:17:45,719 INFO L226 Difference]: Without dead ends: 2673 [2019-12-27 22:17:45,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 22:17:45,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2019-12-27 22:17:45,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2577. [2019-12-27 22:17:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2577 states. [2019-12-27 22:17:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2577 states to 2577 states and 7107 transitions. [2019-12-27 22:17:45,754 INFO L78 Accepts]: Start accepts. Automaton has 2577 states and 7107 transitions. Word has length 66 [2019-12-27 22:17:45,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:45,754 INFO L462 AbstractCegarLoop]: Abstraction has 2577 states and 7107 transitions. [2019-12-27 22:17:45,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:17:45,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2577 states and 7107 transitions. [2019-12-27 22:17:45,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:17:45,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:45,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:45,758 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:45,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:45,758 INFO L82 PathProgramCache]: Analyzing trace with hash -718189845, now seen corresponding path program 1 times [2019-12-27 22:17:45,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:45,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238986485] [2019-12-27 22:17:45,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:46,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 22:17:46,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238986485] [2019-12-27 22:17:46,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:46,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 22:17:46,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2114422338] [2019-12-27 22:17:46,051 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:46,068 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:46,254 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 343 transitions. [2019-12-27 22:17:46,254 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:46,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:17:46,784 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 22:17:46,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:17:46,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:46,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:17:46,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:17:46,786 INFO L87 Difference]: Start difference. First operand 2577 states and 7107 transitions. Second operand 15 states. [2019-12-27 22:17:48,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:48,604 INFO L93 Difference]: Finished difference Result 4148 states and 11179 transitions. [2019-12-27 22:17:48,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 22:17:48,605 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 22:17:48,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:48,611 INFO L225 Difference]: With dead ends: 4148 [2019-12-27 22:17:48,611 INFO L226 Difference]: Without dead ends: 4148 [2019-12-27 22:17:48,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=333, Invalid=1073, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 22:17:48,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4148 states. [2019-12-27 22:17:48,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4148 to 2067. [2019-12-27 22:17:48,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2067 states. [2019-12-27 22:17:48,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 5631 transitions. [2019-12-27 22:17:48,653 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 5631 transitions. Word has length 67 [2019-12-27 22:17:48,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:48,653 INFO L462 AbstractCegarLoop]: Abstraction has 2067 states and 5631 transitions. [2019-12-27 22:17:48,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:17:48,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 5631 transitions. [2019-12-27 22:17:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:17:48,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:48,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:48,656 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:48,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:48,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1533693959, now seen corresponding path program 2 times [2019-12-27 22:17:48,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:48,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934121870] [2019-12-27 22:17:48,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:48,712 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 22:17:48,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934121870] [2019-12-27 22:17:48,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:48,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:17:48,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [577964880] [2019-12-27 22:17:48,713 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:48,731 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:48,899 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 366 transitions. [2019-12-27 22:17:48,900 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:48,900 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:17:48,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:17:48,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:48,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:17:48,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:17:48,901 INFO L87 Difference]: Start difference. First operand 2067 states and 5631 transitions. Second operand 3 states. [2019-12-27 22:17:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:48,952 INFO L93 Difference]: Finished difference Result 2067 states and 5630 transitions. [2019-12-27 22:17:48,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:17:48,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 22:17:48,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:48,956 INFO L225 Difference]: With dead ends: 2067 [2019-12-27 22:17:48,956 INFO L226 Difference]: Without dead ends: 2067 [2019-12-27 22:17:48,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 22:17:48,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2019-12-27 22:17:48,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1772. [2019-12-27 22:17:48,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2019-12-27 22:17:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 4879 transitions. [2019-12-27 22:17:48,983 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 4879 transitions. Word has length 67 [2019-12-27 22:17:48,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:48,983 INFO L462 AbstractCegarLoop]: Abstraction has 1772 states and 4879 transitions. [2019-12-27 22:17:48,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:17:48,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 4879 transitions. [2019-12-27 22:17:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:17:48,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:48,985 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:48,985 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:48,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:48,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1952420056, now seen corresponding path program 1 times [2019-12-27 22:17:48,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:48,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403290254] [2019-12-27 22:17:48,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:17:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:17:49,095 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:17:49,096 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:17:49,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= v_~x$r_buff1_thd1~0_19 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~x$w_buff0_used~0_117) (= v_~x$w_buff1_used~0_74 0) (= 0 v_~x$r_buff0_thd2~0_26) (= v_~x~0_30 0) (= 0 v_~x$r_buff0_thd1~0_20) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1888~0.base_20|) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1888~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1888~0.base_20|) |v_ULTIMATE.start_main_~#t1888~0.offset_17| 0))) (= v_~x$flush_delayed~0_16 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd0~0_47 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$r_buff0_thd0~0_79) (= 0 |v_#NULL.base_4|) (= 0 v_~x$w_buff1~0_29) (= 0 v_~__unbuffered_cnt~0_19) (= v_~y~0_13 0) (= v_~x$r_buff1_thd2~0_19 0) (= v_~__unbuffered_p2_EBX~0_8 0) (= |v_#NULL.offset_4| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1888~0.base_20| 4)) (= v_~x$mem_tmp~0_11 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$r_buff0_thd3~0_19) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 |v_ULTIMATE.start_main_~#t1888~0.offset_17|) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1888~0.base_20| 1)) (= 0 v_~x$w_buff0~0_30) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~weak$$choice2~0_31) (= (select .cse0 |v_ULTIMATE.start_main_~#t1888~0.base_20|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ~x$w_buff0~0=v_~x$w_buff0~0_30, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_~#t1890~0.offset=|v_ULTIMATE.start_main_~#t1890~0.offset_16|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_79, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~x$w_buff1~0=v_~x$w_buff1~0_29, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_30, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_~#t1888~0.base=|v_ULTIMATE.start_main_~#t1888~0.base_20|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~y~0=v_~y~0_13, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t1888~0.offset=|v_ULTIMATE.start_main_~#t1888~0.offset_17|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_47, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1890~0.base=|v_ULTIMATE.start_main_~#t1890~0.base_20|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t1889~0.offset=|v_ULTIMATE.start_main_~#t1889~0.offset_17|, ~weak$$choice2~0=v_~weak$$choice2~0_31, ULTIMATE.start_main_~#t1889~0.base=|v_ULTIMATE.start_main_~#t1889~0.base_21|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1890~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1888~0.base, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1888~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1890~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1889~0.offset, ~weak$$choice2~0, ULTIMATE.start_main_~#t1889~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 22:17:49,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L805-1-->L807: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1889~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1889~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1889~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1889~0.base_11|) |v_ULTIMATE.start_main_~#t1889~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1889~0.base_11| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1889~0.base_11| 1)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1889~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1889~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1889~0.offset=|v_ULTIMATE.start_main_~#t1889~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1889~0.base=|v_ULTIMATE.start_main_~#t1889~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t1889~0.offset, #length, ULTIMATE.start_main_~#t1889~0.base] because there is no mapped edge [2019-12-27 22:17:49,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1890~0.base_9|) 0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1890~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1890~0.base_9|) |v_ULTIMATE.start_main_~#t1890~0.offset_8| 2)) |v_#memory_int_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1890~0.base_9|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1890~0.base_9| 1)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1890~0.base_9| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1890~0.base_9|) (= 0 |v_ULTIMATE.start_main_~#t1890~0.offset_8|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t1890~0.base=|v_ULTIMATE.start_main_~#t1890~0.base_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1890~0.offset=|v_ULTIMATE.start_main_~#t1890~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t1890~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1890~0.offset] because there is no mapped edge [2019-12-27 22:17:49,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= 2 v_~x$w_buff0~0_17) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= 1 v_~x$w_buff0_used~0_80) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~x$w_buff0~0_18 v_~x$w_buff1~0_15) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff1_used~0_49 v_~x$w_buff0_used~0_81) (= (mod v_~x$w_buff1_used~0_49 256) 0)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_18, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_80} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 22:17:49,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In1782760600 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1782760600 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In1782760600 |P2Thread1of1ForFork2_#t~ite15_Out1782760600|)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out1782760600| ~x$w_buff1~0_In1782760600)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1782760600, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1782760600, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1782760600, ~x~0=~x~0_In1782760600} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1782760600|, ~x$w_buff1~0=~x$w_buff1~0_In1782760600, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1782760600, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1782760600, ~x~0=~x~0_In1782760600} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 22:17:49,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 22:17:49,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1018296261 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1018296261 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out1018296261|)) (and (= ~x$w_buff0_used~0_In1018296261 |P2Thread1of1ForFork2_#t~ite17_Out1018296261|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1018296261, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1018296261} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1018296261, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1018296261|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1018296261} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 22:17:49,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1718012257 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1718012257 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In1718012257 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1718012257 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite18_Out1718012257| ~x$w_buff1_used~0_In1718012257) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out1718012257| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1718012257, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1718012257, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1718012257, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1718012257} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1718012257, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1718012257, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1718012257, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1718012257|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1718012257} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 22:17:49,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out-280594330| |P0Thread1of1ForFork0_#t~ite4_Out-280594330|)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-280594330 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-280594330 256)))) (or (and .cse0 (not .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out-280594330| ~x$w_buff1~0_In-280594330) (not .cse2)) (and .cse0 (= ~x~0_In-280594330 |P0Thread1of1ForFork0_#t~ite3_Out-280594330|) (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-280594330, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-280594330, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-280594330, ~x~0=~x~0_In-280594330} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-280594330|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-280594330|, ~x$w_buff1~0=~x$w_buff1~0_In-280594330, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-280594330, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-280594330, ~x~0=~x~0_In-280594330} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 22:17:49,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-873063923 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-873063923 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-873063923|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-873063923 |P0Thread1of1ForFork0_#t~ite5_Out-873063923|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-873063923, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-873063923} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-873063923|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-873063923, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-873063923} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:17:49,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In1328596075 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In1328596075 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1328596075 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1328596075 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1328596075| ~x$w_buff1_used~0_In1328596075) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1328596075| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1328596075, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1328596075, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1328596075, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1328596075} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1328596075|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1328596075, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1328596075, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1328596075, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1328596075} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:17:49,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-380875174 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-380875174 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-380875174|) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out-380875174| ~x$r_buff0_thd3~0_In-380875174) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-380875174, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-380875174} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-380875174, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-380875174|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-380875174} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 22:17:49,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-895327767 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-895327767 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-895327767 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-895327767 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd3~0_In-895327767 |P2Thread1of1ForFork2_#t~ite20_Out-895327767|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-895327767|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-895327767, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-895327767, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-895327767, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-895327767} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-895327767|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-895327767, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-895327767, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-895327767, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-895327767} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 22:17:49,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_13)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 22:17:49,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In344519051 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In344519051 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In344519051 |P0Thread1of1ForFork0_#t~ite7_Out344519051|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out344519051|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In344519051, ~x$w_buff0_used~0=~x$w_buff0_used~0_In344519051} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In344519051, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out344519051|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In344519051} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 22:17:49,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1613973378 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-1613973378 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1613973378 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1613973378 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1613973378| ~x$r_buff1_thd1~0_In-1613973378) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1613973378| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1613973378, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1613973378, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1613973378, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1613973378} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1613973378, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1613973378|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1613973378, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1613973378, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1613973378} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:17:49,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L737-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 22:17:49,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-529207166 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-529207166 256)))) (or (and (= ~x$w_buff0_used~0_In-529207166 |P1Thread1of1ForFork1_#t~ite11_Out-529207166|) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-529207166| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-529207166, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-529207166} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-529207166|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-529207166, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-529207166} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:17:49,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-226382967 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-226382967 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-226382967 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-226382967 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-226382967| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-226382967| ~x$w_buff1_used~0_In-226382967) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-226382967, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-226382967, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-226382967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-226382967} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-226382967, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-226382967, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-226382967|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-226382967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-226382967} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:17:49,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1057562398 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1057562398 256)))) (or (and (= ~x$r_buff0_thd2~0_In-1057562398 ~x$r_buff0_thd2~0_Out-1057562398) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-1057562398)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1057562398, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1057562398} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1057562398|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1057562398, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1057562398} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 22:17:49,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In772086991 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In772086991 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In772086991 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In772086991 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out772086991| ~x$r_buff1_thd2~0_In772086991) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out772086991|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In772086991, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In772086991, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In772086991, ~x$w_buff0_used~0=~x$w_buff0_used~0_In772086991} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In772086991, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In772086991, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In772086991, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out772086991|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In772086991} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:17:49,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:17:49,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:17:49,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In1999684235 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1999684235 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite24_Out1999684235| |ULTIMATE.start_main_#t~ite25_Out1999684235|))) (or (and (= ~x~0_In1999684235 |ULTIMATE.start_main_#t~ite24_Out1999684235|) (or .cse0 .cse1) .cse2) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite24_Out1999684235| ~x$w_buff1~0_In1999684235) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1999684235, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1999684235, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1999684235, ~x~0=~x~0_In1999684235} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1999684235, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1999684235|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1999684235|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1999684235, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1999684235, ~x~0=~x~0_In1999684235} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 22:17:49,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In530649384 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In530649384 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out530649384| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite26_Out530649384| ~x$w_buff0_used~0_In530649384) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In530649384, ~x$w_buff0_used~0=~x$w_buff0_used~0_In530649384} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In530649384, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out530649384|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In530649384} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 22:17:49,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-730806758 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-730806758 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-730806758 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-730806758 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out-730806758| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite27_Out-730806758| ~x$w_buff1_used~0_In-730806758)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-730806758, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-730806758, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-730806758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-730806758} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-730806758, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-730806758, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-730806758|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-730806758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-730806758} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 22:17:49,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In252887384 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In252887384 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out252887384|)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In252887384 |ULTIMATE.start_main_#t~ite28_Out252887384|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In252887384, ~x$w_buff0_used~0=~x$w_buff0_used~0_In252887384} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In252887384, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out252887384|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In252887384} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 22:17:49,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In1275392331 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1275392331 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1275392331 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1275392331 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite29_Out1275392331|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In1275392331 |ULTIMATE.start_main_#t~ite29_Out1275392331|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1275392331, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1275392331, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1275392331, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1275392331} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1275392331, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1275392331|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1275392331, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1275392331, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1275392331} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 22:17:49,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= (mod v_~weak$$choice2~0_21 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 22:17:49,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~x$flush_delayed~0_10 0) (= v_~x$mem_tmp~0_7 v_~x~0_25)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:17:49,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 22:17:49,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:17:49 BasicIcfg [2019-12-27 22:17:49,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:17:49,225 INFO L168 Benchmark]: Toolchain (without parser) took 102492.13 ms. Allocated memory was 145.8 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 102.6 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 22:17:49,226 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 22:17:49,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 813.87 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.2 MB in the beginning and 156.8 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:17:49,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.51 ms. Allocated memory is still 203.4 MB. Free memory was 156.8 MB in the beginning and 153.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:17:49,228 INFO L168 Benchmark]: Boogie Preprocessor took 46.60 ms. Allocated memory is still 203.4 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:17:49,228 INFO L168 Benchmark]: RCFGBuilder took 820.20 ms. Allocated memory is still 203.4 MB. Free memory was 150.9 MB in the beginning and 101.3 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:17:49,229 INFO L168 Benchmark]: TraceAbstraction took 100732.85 ms. Allocated memory was 203.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 22:17:49,232 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.26 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 813.87 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.2 MB in the beginning and 156.8 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.51 ms. Allocated memory is still 203.4 MB. Free memory was 156.8 MB in the beginning and 153.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.60 ms. Allocated memory is still 203.4 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 820.20 ms. Allocated memory is still 203.4 MB. Free memory was 150.9 MB in the beginning and 101.3 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 100732.85 ms. Allocated memory was 203.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 174 ProgramPointsBefore, 96 ProgramPointsAfterwards, 211 TransitionsBefore, 109 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 28 ChoiceCompositions, 5983 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82010 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1888, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L807] FCALL, FORK 0 pthread_create(&t1889, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L809] FCALL, FORK 0 pthread_create(&t1890, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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=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] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 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_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 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 [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 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) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 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 [L815] EXPR 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 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 [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 100.4s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 21.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2910 SDtfs, 3261 SDslu, 5596 SDs, 0 SdLazy, 3433 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 85 SyntacticMatches, 37 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203645occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 50.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 85880 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 980 NumberOfCodeBlocks, 980 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 893 ConstructedInterpolants, 0 QuantifiedInterpolants, 164432 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...