/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:32:30,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:32:30,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:32:30,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:32:30,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:32:30,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:32:30,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:32:30,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:32:30,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:32:30,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:32:30,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:32:30,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:32:30,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:32:30,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:32:30,416 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:32:30,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:32:30,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:32:30,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:32:30,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:32:30,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:32:30,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:32:30,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:32:30,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:32:30,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:32:30,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:32:30,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:32:30,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:32:30,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:32:30,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:32:30,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:32:30,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:32:30,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:32:30,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:32:30,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:32:30,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:32:30,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:32:30,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:32:30,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:32:30,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:32:30,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:32:30,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:32:30,455 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.epf [2019-12-27 05:32:30,474 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:32:30,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:32:30,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:32:30,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:32:30,476 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:32:30,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:32:30,476 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:32:30,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:32:30,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:32:30,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:32:30,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:32:30,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:32:30,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:32:30,478 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:32:30,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:32:30,478 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:32:30,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:32:30,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:32:30,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:32:30,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:32:30,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:32:30,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:32:30,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:32:30,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:32:30,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:32:30,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:32:30,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:32:30,481 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:32:30,481 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:32:30,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:32:30,745 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:32:30,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:32:30,766 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:32:30,767 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:32:30,768 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:32:30,768 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt.i [2019-12-27 05:32:30,840 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93d2b55b3/f9252e76f1a343eb84047955c661d578/FLAG0e414c3d4 [2019-12-27 05:32:31,428 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:32:31,429 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt.i [2019-12-27 05:32:31,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93d2b55b3/f9252e76f1a343eb84047955c661d578/FLAG0e414c3d4 [2019-12-27 05:32:31,717 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93d2b55b3/f9252e76f1a343eb84047955c661d578 [2019-12-27 05:32:31,727 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:32:31,728 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:32:31,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:32:31,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:32:31,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:32:31,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:32:31" (1/1) ... [2019-12-27 05:32:31,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36de6da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:31, skipping insertion in model container [2019-12-27 05:32:31,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:32:31" (1/1) ... [2019-12-27 05:32:31,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:32:31,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:32:32,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:32:32,373 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:32:32,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:32:32,517 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:32:32,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:32 WrapperNode [2019-12-27 05:32:32,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:32:32,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:32:32,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:32:32,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:32:32,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:32" (1/1) ... [2019-12-27 05:32:32,546 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:32" (1/1) ... [2019-12-27 05:32:32,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:32:32,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:32:32,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:32:32,589 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:32:32,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:32" (1/1) ... [2019-12-27 05:32:32,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:32" (1/1) ... [2019-12-27 05:32:32,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:32" (1/1) ... [2019-12-27 05:32:32,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:32" (1/1) ... [2019-12-27 05:32:32,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:32" (1/1) ... [2019-12-27 05:32:32,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:32" (1/1) ... [2019-12-27 05:32:32,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:32" (1/1) ... [2019-12-27 05:32:32,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:32:32,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:32:32,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:32:32,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:32:32,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:32" (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 05:32:32,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:32:32,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:32:32,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:32:32,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:32:32,707 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:32:32,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:32:32,707 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:32:32,709 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:32:32,709 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:32:32,710 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:32:32,710 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 05:32:32,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 05:32:32,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:32:32,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:32:32,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:32:32,714 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 05:32:33,457 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:32:33,458 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:32:33,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:32:33 BoogieIcfgContainer [2019-12-27 05:32:33,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:32:33,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:32:33,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:32:33,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:32:33,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:32:31" (1/3) ... [2019-12-27 05:32:33,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66891b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:32:33, skipping insertion in model container [2019-12-27 05:32:33,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:32" (2/3) ... [2019-12-27 05:32:33,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66891b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:32:33, skipping insertion in model container [2019-12-27 05:32:33,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:32:33" (3/3) ... [2019-12-27 05:32:33,468 INFO L109 eAbstractionObserver]: Analyzing ICFG mix017_power.opt.i [2019-12-27 05:32:33,478 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:32:33,479 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:32:33,487 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:32:33,488 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:32:33,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,529 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,530 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,532 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,533 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,585 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,585 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,592 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,593 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,594 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,603 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,604 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,604 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,604 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,604 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,605 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,605 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,605 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,605 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,605 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,606 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,606 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,606 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,606 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,615 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,615 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,616 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,616 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,616 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,616 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,616 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,616 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,617 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,617 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,623 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,623 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,627 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,629 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,632 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,633 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,633 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:32:33,648 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 05:32:33,667 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:32:33,667 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:32:33,668 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:32:33,668 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:32:33,668 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:32:33,668 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:32:33,668 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:32:33,668 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:32:33,684 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-27 05:32:33,686 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-27 05:32:33,790 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-27 05:32:33,790 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:32:33,810 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 440 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 05:32:33,839 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-27 05:32:33,896 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-27 05:32:33,896 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:32:33,904 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 440 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 05:32:33,926 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 05:32:33,927 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:32:38,097 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 05:32:38,252 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 05:32:38,273 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74863 [2019-12-27 05:32:38,273 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-27 05:32:38,276 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 94 transitions [2019-12-27 05:33:13,170 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 165606 states. [2019-12-27 05:33:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 165606 states. [2019-12-27 05:33:13,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 05:33:13,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:33:13,179 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:33:13,180 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:33:13,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:33:13,185 INFO L82 PathProgramCache]: Analyzing trace with hash -285837663, now seen corresponding path program 1 times [2019-12-27 05:33:13,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:33:13,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124578484] [2019-12-27 05:33:13,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:33:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:33:13,431 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 05:33:13,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124578484] [2019-12-27 05:33:13,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:33:13,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:33:13,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684404672] [2019-12-27 05:33:13,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:33:13,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:33:13,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:33:13,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:33:13,459 INFO L87 Difference]: Start difference. First operand 165606 states. Second operand 3 states. [2019-12-27 05:33:19,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:33:19,297 INFO L93 Difference]: Finished difference Result 163626 states and 782690 transitions. [2019-12-27 05:33:19,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:33:19,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 05:33:19,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:33:20,262 INFO L225 Difference]: With dead ends: 163626 [2019-12-27 05:33:20,263 INFO L226 Difference]: Without dead ends: 154266 [2019-12-27 05:33:20,264 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 05:33:29,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154266 states. [2019-12-27 05:33:33,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154266 to 154266. [2019-12-27 05:33:33,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154266 states. [2019-12-27 05:33:33,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154266 states to 154266 states and 736982 transitions. [2019-12-27 05:33:33,879 INFO L78 Accepts]: Start accepts. Automaton has 154266 states and 736982 transitions. Word has length 7 [2019-12-27 05:33:33,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:33:33,880 INFO L462 AbstractCegarLoop]: Abstraction has 154266 states and 736982 transitions. [2019-12-27 05:33:33,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:33:33,880 INFO L276 IsEmpty]: Start isEmpty. Operand 154266 states and 736982 transitions. [2019-12-27 05:33:33,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 05:33:33,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:33:33,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:33:33,890 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:33:33,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:33:33,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1421349496, now seen corresponding path program 1 times [2019-12-27 05:33:33,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:33:33,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199962943] [2019-12-27 05:33:33,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:33:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:33:34,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 05:33:34,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199962943] [2019-12-27 05:33:34,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:33:34,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:33:34,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459195905] [2019-12-27 05:33:34,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:33:34,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:33:34,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:33:34,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:33:34,055 INFO L87 Difference]: Start difference. First operand 154266 states and 736982 transitions. Second operand 4 states. [2019-12-27 05:33:41,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:33:41,614 INFO L93 Difference]: Finished difference Result 243762 states and 1119228 transitions. [2019-12-27 05:33:41,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:33:41,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 05:33:41,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:33:42,489 INFO L225 Difference]: With dead ends: 243762 [2019-12-27 05:33:42,489 INFO L226 Difference]: Without dead ends: 243552 [2019-12-27 05:33:42,490 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 05:33:55,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243552 states. [2019-12-27 05:34:07,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243552 to 227200. [2019-12-27 05:34:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227200 states. [2019-12-27 05:34:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227200 states to 227200 states and 1051313 transitions. [2019-12-27 05:34:08,735 INFO L78 Accepts]: Start accepts. Automaton has 227200 states and 1051313 transitions. Word has length 15 [2019-12-27 05:34:08,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:08,735 INFO L462 AbstractCegarLoop]: Abstraction has 227200 states and 1051313 transitions. [2019-12-27 05:34:08,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:34:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 227200 states and 1051313 transitions. [2019-12-27 05:34:08,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 05:34:08,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:08,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:34:08,740 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:08,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:08,740 INFO L82 PathProgramCache]: Analyzing trace with hash 965433143, now seen corresponding path program 1 times [2019-12-27 05:34:08,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:08,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987814083] [2019-12-27 05:34:08,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:08,793 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 05:34:08,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987814083] [2019-12-27 05:34:08,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:08,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:34:08,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90505095] [2019-12-27 05:34:08,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:34:08,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:08,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:34:08,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:34:08,795 INFO L87 Difference]: Start difference. First operand 227200 states and 1051313 transitions. Second operand 3 states. [2019-12-27 05:34:11,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:11,149 INFO L93 Difference]: Finished difference Result 141525 states and 590029 transitions. [2019-12-27 05:34:11,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:34:11,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 05:34:11,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:11,545 INFO L225 Difference]: With dead ends: 141525 [2019-12-27 05:34:11,545 INFO L226 Difference]: Without dead ends: 141525 [2019-12-27 05:34:11,545 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 05:34:15,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141525 states. [2019-12-27 05:34:25,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141525 to 141525. [2019-12-27 05:34:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141525 states. [2019-12-27 05:34:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141525 states to 141525 states and 590029 transitions. [2019-12-27 05:34:25,518 INFO L78 Accepts]: Start accepts. Automaton has 141525 states and 590029 transitions. Word has length 15 [2019-12-27 05:34:25,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:25,519 INFO L462 AbstractCegarLoop]: Abstraction has 141525 states and 590029 transitions. [2019-12-27 05:34:25,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:34:25,519 INFO L276 IsEmpty]: Start isEmpty. Operand 141525 states and 590029 transitions. [2019-12-27 05:34:25,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:34:25,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:25,525 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:34:25,526 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:25,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:25,527 INFO L82 PathProgramCache]: Analyzing trace with hash 353132370, now seen corresponding path program 1 times [2019-12-27 05:34:25,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:25,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78984701] [2019-12-27 05:34:25,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:25,593 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 05:34:25,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78984701] [2019-12-27 05:34:25,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:25,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:34:25,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447484595] [2019-12-27 05:34:25,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:34:25,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:25,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:34:25,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:34:25,600 INFO L87 Difference]: Start difference. First operand 141525 states and 590029 transitions. Second operand 4 states. [2019-12-27 05:34:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:25,821 INFO L93 Difference]: Finished difference Result 38307 states and 135561 transitions. [2019-12-27 05:34:25,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:34:25,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 05:34:25,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:25,894 INFO L225 Difference]: With dead ends: 38307 [2019-12-27 05:34:25,894 INFO L226 Difference]: Without dead ends: 38307 [2019-12-27 05:34:25,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:34:26,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38307 states. [2019-12-27 05:34:27,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38307 to 38307. [2019-12-27 05:34:27,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38307 states. [2019-12-27 05:34:27,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38307 states to 38307 states and 135561 transitions. [2019-12-27 05:34:27,550 INFO L78 Accepts]: Start accepts. Automaton has 38307 states and 135561 transitions. Word has length 16 [2019-12-27 05:34:27,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:27,550 INFO L462 AbstractCegarLoop]: Abstraction has 38307 states and 135561 transitions. [2019-12-27 05:34:27,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:34:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 38307 states and 135561 transitions. [2019-12-27 05:34:27,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:34:27,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:27,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:34:27,553 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:27,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:27,553 INFO L82 PathProgramCache]: Analyzing trace with hash 155833959, now seen corresponding path program 1 times [2019-12-27 05:34:27,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:27,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666594069] [2019-12-27 05:34:27,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:27,674 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 05:34:27,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666594069] [2019-12-27 05:34:27,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:27,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:34:27,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052273996] [2019-12-27 05:34:27,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:34:27,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:27,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:34:27,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:34:27,676 INFO L87 Difference]: Start difference. First operand 38307 states and 135561 transitions. Second operand 4 states. [2019-12-27 05:34:28,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:28,126 INFO L93 Difference]: Finished difference Result 48375 states and 169656 transitions. [2019-12-27 05:34:28,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:34:28,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 05:34:28,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:28,219 INFO L225 Difference]: With dead ends: 48375 [2019-12-27 05:34:28,219 INFO L226 Difference]: Without dead ends: 48364 [2019-12-27 05:34:28,220 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 05:34:28,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48364 states. [2019-12-27 05:34:31,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48364 to 42700. [2019-12-27 05:34:31,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42700 states. [2019-12-27 05:34:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42700 states to 42700 states and 150756 transitions. [2019-12-27 05:34:31,892 INFO L78 Accepts]: Start accepts. Automaton has 42700 states and 150756 transitions. Word has length 16 [2019-12-27 05:34:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:31,893 INFO L462 AbstractCegarLoop]: Abstraction has 42700 states and 150756 transitions. [2019-12-27 05:34:31,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:34:31,893 INFO L276 IsEmpty]: Start isEmpty. Operand 42700 states and 150756 transitions. [2019-12-27 05:34:31,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 05:34:31,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:31,908 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] [2019-12-27 05:34:31,908 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:31,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:31,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2135022272, now seen corresponding path program 1 times [2019-12-27 05:34:31,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:31,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349389444] [2019-12-27 05:34:31,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:32,083 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 05:34:32,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349389444] [2019-12-27 05:34:32,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:32,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:34:32,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800911190] [2019-12-27 05:34:32,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:34:32,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:32,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:34:32,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:34:32,086 INFO L87 Difference]: Start difference. First operand 42700 states and 150756 transitions. Second operand 6 states. [2019-12-27 05:34:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:33,015 INFO L93 Difference]: Finished difference Result 56720 states and 196970 transitions. [2019-12-27 05:34:33,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:34:33,015 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 05:34:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:33,126 INFO L225 Difference]: With dead ends: 56720 [2019-12-27 05:34:33,126 INFO L226 Difference]: Without dead ends: 56709 [2019-12-27 05:34:33,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:34:33,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56709 states. [2019-12-27 05:34:34,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56709 to 42805. [2019-12-27 05:34:34,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42805 states. [2019-12-27 05:34:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42805 states to 42805 states and 151046 transitions. [2019-12-27 05:34:34,388 INFO L78 Accepts]: Start accepts. Automaton has 42805 states and 151046 transitions. Word has length 24 [2019-12-27 05:34:34,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:34,388 INFO L462 AbstractCegarLoop]: Abstraction has 42805 states and 151046 transitions. [2019-12-27 05:34:34,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:34:34,388 INFO L276 IsEmpty]: Start isEmpty. Operand 42805 states and 151046 transitions. [2019-12-27 05:34:34,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 05:34:34,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:34,400 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] [2019-12-27 05:34:34,400 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:34,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:34,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1263479572, now seen corresponding path program 2 times [2019-12-27 05:34:34,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:34,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634957004] [2019-12-27 05:34:34,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:34,470 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 05:34:34,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634957004] [2019-12-27 05:34:34,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:34,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:34:34,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682235834] [2019-12-27 05:34:34,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:34:34,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:34,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:34:34,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:34:34,472 INFO L87 Difference]: Start difference. First operand 42805 states and 151046 transitions. Second operand 5 states. [2019-12-27 05:34:35,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:35,064 INFO L93 Difference]: Finished difference Result 51997 states and 181354 transitions. [2019-12-27 05:34:35,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:34:35,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 05:34:35,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:35,167 INFO L225 Difference]: With dead ends: 51997 [2019-12-27 05:34:35,168 INFO L226 Difference]: Without dead ends: 51983 [2019-12-27 05:34:35,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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 05:34:35,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51983 states. [2019-12-27 05:34:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51983 to 42005. [2019-12-27 05:34:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42005 states. [2019-12-27 05:34:36,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42005 states to 42005 states and 148074 transitions. [2019-12-27 05:34:36,570 INFO L78 Accepts]: Start accepts. Automaton has 42005 states and 148074 transitions. Word has length 24 [2019-12-27 05:34:36,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:36,570 INFO L462 AbstractCegarLoop]: Abstraction has 42005 states and 148074 transitions. [2019-12-27 05:34:36,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:34:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 42005 states and 148074 transitions. [2019-12-27 05:34:36,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 05:34:36,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:36,590 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] [2019-12-27 05:34:36,591 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:36,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:36,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1706816570, now seen corresponding path program 1 times [2019-12-27 05:34:36,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:36,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520089956] [2019-12-27 05:34:36,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:36,653 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 05:34:36,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520089956] [2019-12-27 05:34:36,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:36,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:34:36,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915089963] [2019-12-27 05:34:36,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:34:36,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:36,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:34:36,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:34:36,656 INFO L87 Difference]: Start difference. First operand 42005 states and 148074 transitions. Second operand 5 states. [2019-12-27 05:34:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:36,800 INFO L93 Difference]: Finished difference Result 21498 states and 76764 transitions. [2019-12-27 05:34:36,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:34:36,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 05:34:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:36,839 INFO L225 Difference]: With dead ends: 21498 [2019-12-27 05:34:36,840 INFO L226 Difference]: Without dead ends: 21498 [2019-12-27 05:34:36,840 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 05:34:36,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21498 states. [2019-12-27 05:34:37,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21498 to 21306. [2019-12-27 05:34:37,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21306 states. [2019-12-27 05:34:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21306 states to 21306 states and 76108 transitions. [2019-12-27 05:34:37,199 INFO L78 Accepts]: Start accepts. Automaton has 21306 states and 76108 transitions. Word has length 28 [2019-12-27 05:34:37,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:37,199 INFO L462 AbstractCegarLoop]: Abstraction has 21306 states and 76108 transitions. [2019-12-27 05:34:37,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:34:37,199 INFO L276 IsEmpty]: Start isEmpty. Operand 21306 states and 76108 transitions. [2019-12-27 05:34:37,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 05:34:37,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:37,233 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] [2019-12-27 05:34:37,234 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:37,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:37,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1629751536, now seen corresponding path program 1 times [2019-12-27 05:34:37,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:37,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374566199] [2019-12-27 05:34:37,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:37,307 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 05:34:37,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374566199] [2019-12-27 05:34:37,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:37,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:34:37,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457280911] [2019-12-27 05:34:37,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:34:37,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:37,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:34:37,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:34:37,312 INFO L87 Difference]: Start difference. First operand 21306 states and 76108 transitions. Second operand 4 states. [2019-12-27 05:34:37,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:37,512 INFO L93 Difference]: Finished difference Result 30881 states and 105340 transitions. [2019-12-27 05:34:37,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:34:37,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 05:34:37,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:37,581 INFO L225 Difference]: With dead ends: 30881 [2019-12-27 05:34:37,581 INFO L226 Difference]: Without dead ends: 21608 [2019-12-27 05:34:37,582 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 05:34:37,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21608 states. [2019-12-27 05:34:38,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21608 to 21512. [2019-12-27 05:34:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21512 states. [2019-12-27 05:34:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21512 states to 21512 states and 75947 transitions. [2019-12-27 05:34:38,484 INFO L78 Accepts]: Start accepts. Automaton has 21512 states and 75947 transitions. Word has length 42 [2019-12-27 05:34:38,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:38,484 INFO L462 AbstractCegarLoop]: Abstraction has 21512 states and 75947 transitions. [2019-12-27 05:34:38,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:34:38,485 INFO L276 IsEmpty]: Start isEmpty. Operand 21512 states and 75947 transitions. [2019-12-27 05:34:38,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 05:34:38,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:38,520 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] [2019-12-27 05:34:38,520 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:38,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:38,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1940145770, now seen corresponding path program 2 times [2019-12-27 05:34:38,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:38,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541148572] [2019-12-27 05:34:38,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:38,575 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 05:34:38,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541148572] [2019-12-27 05:34:38,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:38,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:34:38,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624433232] [2019-12-27 05:34:38,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:34:38,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:38,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:34:38,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:34:38,578 INFO L87 Difference]: Start difference. First operand 21512 states and 75947 transitions. Second operand 4 states. [2019-12-27 05:34:38,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:38,722 INFO L93 Difference]: Finished difference Result 34397 states and 122371 transitions. [2019-12-27 05:34:38,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:34:38,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 05:34:38,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:38,756 INFO L225 Difference]: With dead ends: 34397 [2019-12-27 05:34:38,756 INFO L226 Difference]: Without dead ends: 18368 [2019-12-27 05:34:38,756 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 05:34:38,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18368 states. [2019-12-27 05:34:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18368 to 18290. [2019-12-27 05:34:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18290 states. [2019-12-27 05:34:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18290 states to 18290 states and 63856 transitions. [2019-12-27 05:34:39,069 INFO L78 Accepts]: Start accepts. Automaton has 18290 states and 63856 transitions. Word has length 42 [2019-12-27 05:34:39,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:39,069 INFO L462 AbstractCegarLoop]: Abstraction has 18290 states and 63856 transitions. [2019-12-27 05:34:39,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:34:39,069 INFO L276 IsEmpty]: Start isEmpty. Operand 18290 states and 63856 transitions. [2019-12-27 05:34:39,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 05:34:39,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:39,094 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] [2019-12-27 05:34:39,094 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:39,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:39,094 INFO L82 PathProgramCache]: Analyzing trace with hash -254857110, now seen corresponding path program 3 times [2019-12-27 05:34:39,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:39,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531163365] [2019-12-27 05:34:39,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:39,170 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 05:34:39,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531163365] [2019-12-27 05:34:39,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:39,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:34:39,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739112436] [2019-12-27 05:34:39,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:34:39,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:39,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:34:39,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:34:39,173 INFO L87 Difference]: Start difference. First operand 18290 states and 63856 transitions. Second operand 6 states. [2019-12-27 05:34:39,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:39,298 INFO L93 Difference]: Finished difference Result 17048 states and 60717 transitions. [2019-12-27 05:34:39,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:34:39,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 05:34:39,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:39,325 INFO L225 Difference]: With dead ends: 17048 [2019-12-27 05:34:39,325 INFO L226 Difference]: Without dead ends: 13450 [2019-12-27 05:34:39,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 05:34:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13450 states. [2019-12-27 05:34:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13450 to 13050. [2019-12-27 05:34:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13050 states. [2019-12-27 05:34:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13050 states to 13050 states and 47484 transitions. [2019-12-27 05:34:39,565 INFO L78 Accepts]: Start accepts. Automaton has 13050 states and 47484 transitions. Word has length 42 [2019-12-27 05:34:39,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:39,566 INFO L462 AbstractCegarLoop]: Abstraction has 13050 states and 47484 transitions. [2019-12-27 05:34:39,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:34:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 13050 states and 47484 transitions. [2019-12-27 05:34:39,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:34:39,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:39,583 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] [2019-12-27 05:34:39,583 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:39,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:39,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1833036015, now seen corresponding path program 1 times [2019-12-27 05:34:39,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:39,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75805862] [2019-12-27 05:34:39,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:39,662 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 05:34:39,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75805862] [2019-12-27 05:34:39,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:39,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:34:39,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716474595] [2019-12-27 05:34:39,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:34:39,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:39,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:34:39,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:34:39,664 INFO L87 Difference]: Start difference. First operand 13050 states and 47484 transitions. Second operand 4 states. [2019-12-27 05:34:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:39,754 INFO L93 Difference]: Finished difference Result 16902 states and 60194 transitions. [2019-12-27 05:34:39,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:34:39,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-27 05:34:39,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:39,762 INFO L225 Difference]: With dead ends: 16902 [2019-12-27 05:34:39,762 INFO L226 Difference]: Without dead ends: 4163 [2019-12-27 05:34:39,762 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 05:34:39,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4163 states. [2019-12-27 05:34:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4163 to 4163. [2019-12-27 05:34:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4163 states. [2019-12-27 05:34:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 13587 transitions. [2019-12-27 05:34:39,832 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 13587 transitions. Word has length 57 [2019-12-27 05:34:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:39,832 INFO L462 AbstractCegarLoop]: Abstraction has 4163 states and 13587 transitions. [2019-12-27 05:34:39,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:34:39,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 13587 transitions. [2019-12-27 05:34:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:34:39,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:39,837 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] [2019-12-27 05:34:39,837 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:39,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:39,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1816371613, now seen corresponding path program 2 times [2019-12-27 05:34:39,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:39,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689265644] [2019-12-27 05:34:39,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:34:39,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689265644] [2019-12-27 05:34:39,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:39,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:34:39,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536437342] [2019-12-27 05:34:39,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:34:39,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:39,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:34:39,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:34:39,920 INFO L87 Difference]: Start difference. First operand 4163 states and 13587 transitions. Second operand 7 states. [2019-12-27 05:34:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:40,175 INFO L93 Difference]: Finished difference Result 8316 states and 26619 transitions. [2019-12-27 05:34:40,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:34:40,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 05:34:40,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:40,186 INFO L225 Difference]: With dead ends: 8316 [2019-12-27 05:34:40,186 INFO L226 Difference]: Without dead ends: 6024 [2019-12-27 05:34:40,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:34:40,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2019-12-27 05:34:40,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 5378. [2019-12-27 05:34:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5378 states. [2019-12-27 05:34:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5378 states to 5378 states and 17440 transitions. [2019-12-27 05:34:40,471 INFO L78 Accepts]: Start accepts. Automaton has 5378 states and 17440 transitions. Word has length 57 [2019-12-27 05:34:40,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:40,471 INFO L462 AbstractCegarLoop]: Abstraction has 5378 states and 17440 transitions. [2019-12-27 05:34:40,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:34:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5378 states and 17440 transitions. [2019-12-27 05:34:40,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:34:40,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:40,481 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] [2019-12-27 05:34:40,481 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:40,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:40,482 INFO L82 PathProgramCache]: Analyzing trace with hash 952900063, now seen corresponding path program 3 times [2019-12-27 05:34:40,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:40,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895260525] [2019-12-27 05:34:40,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:40,575 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 05:34:40,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895260525] [2019-12-27 05:34:40,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:40,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:34:40,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667302316] [2019-12-27 05:34:40,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:34:40,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:40,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:34:40,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:34:40,578 INFO L87 Difference]: Start difference. First operand 5378 states and 17440 transitions. Second operand 7 states. [2019-12-27 05:34:40,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:40,842 INFO L93 Difference]: Finished difference Result 9966 states and 31598 transitions. [2019-12-27 05:34:40,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:34:40,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 05:34:40,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:40,857 INFO L225 Difference]: With dead ends: 9966 [2019-12-27 05:34:40,857 INFO L226 Difference]: Without dead ends: 7295 [2019-12-27 05:34:40,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:34:40,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7295 states. [2019-12-27 05:34:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7295 to 6431. [2019-12-27 05:34:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6431 states. [2019-12-27 05:34:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6431 states to 6431 states and 20643 transitions. [2019-12-27 05:34:40,972 INFO L78 Accepts]: Start accepts. Automaton has 6431 states and 20643 transitions. Word has length 57 [2019-12-27 05:34:40,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:40,972 INFO L462 AbstractCegarLoop]: Abstraction has 6431 states and 20643 transitions. [2019-12-27 05:34:40,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:34:40,972 INFO L276 IsEmpty]: Start isEmpty. Operand 6431 states and 20643 transitions. [2019-12-27 05:34:40,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:34:40,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:40,982 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] [2019-12-27 05:34:40,982 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:40,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:40,983 INFO L82 PathProgramCache]: Analyzing trace with hash -282768913, now seen corresponding path program 4 times [2019-12-27 05:34:40,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:40,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260703074] [2019-12-27 05:34:40,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:41,130 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 05:34:41,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260703074] [2019-12-27 05:34:41,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:41,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:34:41,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554046181] [2019-12-27 05:34:41,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:34:41,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:41,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:34:41,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:34:41,132 INFO L87 Difference]: Start difference. First operand 6431 states and 20643 transitions. Second operand 9 states. [2019-12-27 05:34:42,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:42,887 INFO L93 Difference]: Finished difference Result 42264 states and 136685 transitions. [2019-12-27 05:34:42,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 05:34:42,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 05:34:42,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:42,943 INFO L225 Difference]: With dead ends: 42264 [2019-12-27 05:34:42,944 INFO L226 Difference]: Without dead ends: 33828 [2019-12-27 05:34:42,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=454, Invalid=1616, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 05:34:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33828 states. [2019-12-27 05:34:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33828 to 9147. [2019-12-27 05:34:43,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9147 states. [2019-12-27 05:34:43,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9147 states to 9147 states and 29781 transitions. [2019-12-27 05:34:43,276 INFO L78 Accepts]: Start accepts. Automaton has 9147 states and 29781 transitions. Word has length 57 [2019-12-27 05:34:43,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:43,276 INFO L462 AbstractCegarLoop]: Abstraction has 9147 states and 29781 transitions. [2019-12-27 05:34:43,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:34:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 9147 states and 29781 transitions. [2019-12-27 05:34:43,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:34:43,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:43,287 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] [2019-12-27 05:34:43,287 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:43,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:43,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1223483339, now seen corresponding path program 5 times [2019-12-27 05:34:43,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:43,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532333152] [2019-12-27 05:34:43,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:43,399 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 05:34:43,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532333152] [2019-12-27 05:34:43,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:43,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:34:43,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226732430] [2019-12-27 05:34:43,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:34:43,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:43,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:34:43,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:34:43,401 INFO L87 Difference]: Start difference. First operand 9147 states and 29781 transitions. Second operand 9 states. [2019-12-27 05:34:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:45,199 INFO L93 Difference]: Finished difference Result 37087 states and 118538 transitions. [2019-12-27 05:34:45,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 05:34:45,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 05:34:45,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:45,249 INFO L225 Difference]: With dead ends: 37087 [2019-12-27 05:34:45,249 INFO L226 Difference]: Without dead ends: 30755 [2019-12-27 05:34:45,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 05:34:45,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30755 states. [2019-12-27 05:34:45,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30755 to 9167. [2019-12-27 05:34:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9167 states. [2019-12-27 05:34:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9167 states to 9167 states and 29928 transitions. [2019-12-27 05:34:45,547 INFO L78 Accepts]: Start accepts. Automaton has 9167 states and 29928 transitions. Word has length 57 [2019-12-27 05:34:45,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:45,548 INFO L462 AbstractCegarLoop]: Abstraction has 9167 states and 29928 transitions. [2019-12-27 05:34:45,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:34:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 9167 states and 29928 transitions. [2019-12-27 05:34:45,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:34:45,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:45,558 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] [2019-12-27 05:34:45,558 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:45,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:45,558 INFO L82 PathProgramCache]: Analyzing trace with hash 417709041, now seen corresponding path program 6 times [2019-12-27 05:34:45,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:45,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387509779] [2019-12-27 05:34:45,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:45,657 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 05:34:45,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387509779] [2019-12-27 05:34:45,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:45,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:34:45,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477705596] [2019-12-27 05:34:45,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:34:45,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:45,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:34:45,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:34:45,659 INFO L87 Difference]: Start difference. First operand 9167 states and 29928 transitions. Second operand 3 states. [2019-12-27 05:34:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:45,701 INFO L93 Difference]: Finished difference Result 8222 states and 26055 transitions. [2019-12-27 05:34:45,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:34:45,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 05:34:45,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:45,718 INFO L225 Difference]: With dead ends: 8222 [2019-12-27 05:34:45,718 INFO L226 Difference]: Without dead ends: 8222 [2019-12-27 05:34:45,719 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 05:34:45,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8222 states. [2019-12-27 05:34:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8222 to 7906. [2019-12-27 05:34:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7906 states. [2019-12-27 05:34:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7906 states to 7906 states and 24949 transitions. [2019-12-27 05:34:45,922 INFO L78 Accepts]: Start accepts. Automaton has 7906 states and 24949 transitions. Word has length 57 [2019-12-27 05:34:45,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:45,922 INFO L462 AbstractCegarLoop]: Abstraction has 7906 states and 24949 transitions. [2019-12-27 05:34:45,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:34:45,922 INFO L276 IsEmpty]: Start isEmpty. Operand 7906 states and 24949 transitions. [2019-12-27 05:34:45,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 05:34:45,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:45,937 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] [2019-12-27 05:34:45,938 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:45,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:45,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1413317050, now seen corresponding path program 1 times [2019-12-27 05:34:45,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:45,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601078488] [2019-12-27 05:34:45,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:46,091 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 05:34:46,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601078488] [2019-12-27 05:34:46,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:46,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:34:46,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282773637] [2019-12-27 05:34:46,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:34:46,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:46,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:34:46,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:34:46,100 INFO L87 Difference]: Start difference. First operand 7906 states and 24949 transitions. Second operand 9 states. [2019-12-27 05:34:46,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:46,970 INFO L93 Difference]: Finished difference Result 12674 states and 39491 transitions. [2019-12-27 05:34:46,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 05:34:46,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-12-27 05:34:46,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:46,989 INFO L225 Difference]: With dead ends: 12674 [2019-12-27 05:34:46,989 INFO L226 Difference]: Without dead ends: 9226 [2019-12-27 05:34:46,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-27 05:34:47,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9226 states. [2019-12-27 05:34:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9226 to 8130. [2019-12-27 05:34:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8130 states. [2019-12-27 05:34:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8130 states to 8130 states and 25444 transitions. [2019-12-27 05:34:47,208 INFO L78 Accepts]: Start accepts. Automaton has 8130 states and 25444 transitions. Word has length 58 [2019-12-27 05:34:47,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:47,208 INFO L462 AbstractCegarLoop]: Abstraction has 8130 states and 25444 transitions. [2019-12-27 05:34:47,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:34:47,208 INFO L276 IsEmpty]: Start isEmpty. Operand 8130 states and 25444 transitions. [2019-12-27 05:34:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 05:34:47,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:47,220 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] [2019-12-27 05:34:47,221 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:47,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:47,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1979655394, now seen corresponding path program 2 times [2019-12-27 05:34:47,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:47,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220612729] [2019-12-27 05:34:47,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:47,419 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 05:34:47,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220612729] [2019-12-27 05:34:47,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:47,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:34:47,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668258011] [2019-12-27 05:34:47,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:34:47,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:47,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:34:47,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:34:47,422 INFO L87 Difference]: Start difference. First operand 8130 states and 25444 transitions. Second operand 10 states. [2019-12-27 05:34:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:50,008 INFO L93 Difference]: Finished difference Result 26924 states and 82682 transitions. [2019-12-27 05:34:50,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 05:34:50,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-27 05:34:50,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:50,048 INFO L225 Difference]: With dead ends: 26924 [2019-12-27 05:34:50,049 INFO L226 Difference]: Without dead ends: 26744 [2019-12-27 05:34:50,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=733, Unknown=0, NotChecked=0, Total=930 [2019-12-27 05:34:50,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26744 states. [2019-12-27 05:34:50,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26744 to 16146. [2019-12-27 05:34:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16146 states. [2019-12-27 05:34:50,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16146 states to 16146 states and 49902 transitions. [2019-12-27 05:34:50,386 INFO L78 Accepts]: Start accepts. Automaton has 16146 states and 49902 transitions. Word has length 58 [2019-12-27 05:34:50,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:50,386 INFO L462 AbstractCegarLoop]: Abstraction has 16146 states and 49902 transitions. [2019-12-27 05:34:50,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:34:50,386 INFO L276 IsEmpty]: Start isEmpty. Operand 16146 states and 49902 transitions. [2019-12-27 05:34:50,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 05:34:50,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:50,404 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] [2019-12-27 05:34:50,404 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:50,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:50,404 INFO L82 PathProgramCache]: Analyzing trace with hash -56996804, now seen corresponding path program 3 times [2019-12-27 05:34:50,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:50,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464828584] [2019-12-27 05:34:50,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:50,606 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 05:34:50,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464828584] [2019-12-27 05:34:50,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:50,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:34:50,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871445994] [2019-12-27 05:34:50,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:34:50,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:50,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:34:50,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:34:50,608 INFO L87 Difference]: Start difference. First operand 16146 states and 49902 transitions. Second operand 10 states. [2019-12-27 05:34:51,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:51,436 INFO L93 Difference]: Finished difference Result 22507 states and 68885 transitions. [2019-12-27 05:34:51,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 05:34:51,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-27 05:34:51,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:51,482 INFO L225 Difference]: With dead ends: 22507 [2019-12-27 05:34:51,483 INFO L226 Difference]: Without dead ends: 21929 [2019-12-27 05:34:51,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-12-27 05:34:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21929 states. [2019-12-27 05:34:51,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21929 to 19975. [2019-12-27 05:34:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19975 states. [2019-12-27 05:34:52,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19975 states to 19975 states and 61364 transitions. [2019-12-27 05:34:52,023 INFO L78 Accepts]: Start accepts. Automaton has 19975 states and 61364 transitions. Word has length 58 [2019-12-27 05:34:52,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:52,023 INFO L462 AbstractCegarLoop]: Abstraction has 19975 states and 61364 transitions. [2019-12-27 05:34:52,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:34:52,023 INFO L276 IsEmpty]: Start isEmpty. Operand 19975 states and 61364 transitions. [2019-12-27 05:34:52,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 05:34:52,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:52,066 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] [2019-12-27 05:34:52,066 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:52,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:52,070 INFO L82 PathProgramCache]: Analyzing trace with hash -433724914, now seen corresponding path program 4 times [2019-12-27 05:34:52,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:52,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987490468] [2019-12-27 05:34:52,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:52,151 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 05:34:52,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987490468] [2019-12-27 05:34:52,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:52,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:34:52,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148744343] [2019-12-27 05:34:52,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:34:52,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:52,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:34:52,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:34:52,153 INFO L87 Difference]: Start difference. First operand 19975 states and 61364 transitions. Second operand 3 states. [2019-12-27 05:34:52,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:52,246 INFO L93 Difference]: Finished difference Result 19973 states and 61359 transitions. [2019-12-27 05:34:52,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:34:52,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 05:34:52,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:52,284 INFO L225 Difference]: With dead ends: 19973 [2019-12-27 05:34:52,285 INFO L226 Difference]: Without dead ends: 19973 [2019-12-27 05:34:52,285 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 05:34:52,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19973 states. [2019-12-27 05:34:52,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19973 to 19124. [2019-12-27 05:34:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19124 states. [2019-12-27 05:34:52,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19124 states to 19124 states and 59168 transitions. [2019-12-27 05:34:52,904 INFO L78 Accepts]: Start accepts. Automaton has 19124 states and 59168 transitions. Word has length 58 [2019-12-27 05:34:52,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:52,904 INFO L462 AbstractCegarLoop]: Abstraction has 19124 states and 59168 transitions. [2019-12-27 05:34:52,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:34:52,904 INFO L276 IsEmpty]: Start isEmpty. Operand 19124 states and 59168 transitions. [2019-12-27 05:34:52,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 05:34:52,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:52,926 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] [2019-12-27 05:34:52,926 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:52,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:52,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1070518011, now seen corresponding path program 1 times [2019-12-27 05:34:52,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:52,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604317494] [2019-12-27 05:34:52,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:53,340 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 05:34:53,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604317494] [2019-12-27 05:34:53,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:53,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 05:34:53,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437377937] [2019-12-27 05:34:53,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 05:34:53,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:53,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 05:34:53,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-12-27 05:34:53,343 INFO L87 Difference]: Start difference. First operand 19124 states and 59168 transitions. Second operand 17 states. [2019-12-27 05:34:56,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:56,620 INFO L93 Difference]: Finished difference Result 36902 states and 112839 transitions. [2019-12-27 05:34:56,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 05:34:56,621 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-27 05:34:56,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:56,670 INFO L225 Difference]: With dead ends: 36902 [2019-12-27 05:34:56,670 INFO L226 Difference]: Without dead ends: 32108 [2019-12-27 05:34:56,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=357, Invalid=1899, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 05:34:56,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32108 states. [2019-12-27 05:34:57,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32108 to 20520. [2019-12-27 05:34:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20520 states. [2019-12-27 05:34:57,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20520 states to 20520 states and 63401 transitions. [2019-12-27 05:34:57,094 INFO L78 Accepts]: Start accepts. Automaton has 20520 states and 63401 transitions. Word has length 59 [2019-12-27 05:34:57,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:57,094 INFO L462 AbstractCegarLoop]: Abstraction has 20520 states and 63401 transitions. [2019-12-27 05:34:57,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 05:34:57,095 INFO L276 IsEmpty]: Start isEmpty. Operand 20520 states and 63401 transitions. [2019-12-27 05:34:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 05:34:57,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:57,118 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] [2019-12-27 05:34:57,119 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:57,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:57,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1312653499, now seen corresponding path program 2 times [2019-12-27 05:34:57,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:57,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073104580] [2019-12-27 05:34:57,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:57,258 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 05:34:57,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073104580] [2019-12-27 05:34:57,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:57,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:34:57,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135969243] [2019-12-27 05:34:57,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:34:57,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:57,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:34:57,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:34:57,260 INFO L87 Difference]: Start difference. First operand 20520 states and 63401 transitions. Second operand 10 states. [2019-12-27 05:34:58,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:34:58,129 INFO L93 Difference]: Finished difference Result 22637 states and 69197 transitions. [2019-12-27 05:34:58,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:34:58,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-27 05:34:58,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:34:58,156 INFO L225 Difference]: With dead ends: 22637 [2019-12-27 05:34:58,156 INFO L226 Difference]: Without dead ends: 18008 [2019-12-27 05:34:58,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:34:58,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18008 states. [2019-12-27 05:34:58,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18008 to 16073. [2019-12-27 05:34:58,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16073 states. [2019-12-27 05:34:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16073 states to 16073 states and 49843 transitions. [2019-12-27 05:34:58,415 INFO L78 Accepts]: Start accepts. Automaton has 16073 states and 49843 transitions. Word has length 59 [2019-12-27 05:34:58,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:34:58,415 INFO L462 AbstractCegarLoop]: Abstraction has 16073 states and 49843 transitions. [2019-12-27 05:34:58,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:34:58,415 INFO L276 IsEmpty]: Start isEmpty. Operand 16073 states and 49843 transitions. [2019-12-27 05:34:58,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 05:34:58,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:34:58,433 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] [2019-12-27 05:34:58,433 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:34:58,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:34:58,433 INFO L82 PathProgramCache]: Analyzing trace with hash 912465139, now seen corresponding path program 3 times [2019-12-27 05:34:58,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:34:58,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776522382] [2019-12-27 05:34:58,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:34:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:34:58,895 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 05:34:58,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776522382] [2019-12-27 05:34:58,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:34:58,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 05:34:58,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189436835] [2019-12-27 05:34:58,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 05:34:58,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:34:58,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 05:34:58,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-27 05:34:58,898 INFO L87 Difference]: Start difference. First operand 16073 states and 49843 transitions. Second operand 18 states. [2019-12-27 05:35:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:35:02,940 INFO L93 Difference]: Finished difference Result 29918 states and 91365 transitions. [2019-12-27 05:35:02,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 05:35:02,942 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2019-12-27 05:35:02,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:35:02,983 INFO L225 Difference]: With dead ends: 29918 [2019-12-27 05:35:02,983 INFO L226 Difference]: Without dead ends: 27402 [2019-12-27 05:35:02,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=418, Invalid=2234, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 05:35:03,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27402 states. [2019-12-27 05:35:03,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27402 to 16919. [2019-12-27 05:35:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16919 states. [2019-12-27 05:35:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16919 states to 16919 states and 52306 transitions. [2019-12-27 05:35:03,655 INFO L78 Accepts]: Start accepts. Automaton has 16919 states and 52306 transitions. Word has length 59 [2019-12-27 05:35:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:35:03,655 INFO L462 AbstractCegarLoop]: Abstraction has 16919 states and 52306 transitions. [2019-12-27 05:35:03,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 05:35:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 16919 states and 52306 transitions. [2019-12-27 05:35:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 05:35:03,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:35:03,674 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] [2019-12-27 05:35:03,674 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:35:03,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:35:03,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1470706371, now seen corresponding path program 4 times [2019-12-27 05:35:03,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:35:03,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558556919] [2019-12-27 05:35:03,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:35:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:35:03,894 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 05:35:03,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558556919] [2019-12-27 05:35:03,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:35:03,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:35:03,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145101005] [2019-12-27 05:35:03,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:35:03,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:35:03,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:35:03,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:35:03,897 INFO L87 Difference]: Start difference. First operand 16919 states and 52306 transitions. Second operand 11 states. [2019-12-27 05:35:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:35:04,717 INFO L93 Difference]: Finished difference Result 21741 states and 66357 transitions. [2019-12-27 05:35:04,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 05:35:04,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-27 05:35:04,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:35:04,744 INFO L225 Difference]: With dead ends: 21741 [2019-12-27 05:35:04,744 INFO L226 Difference]: Without dead ends: 16692 [2019-12-27 05:35:04,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-27 05:35:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16692 states. [2019-12-27 05:35:04,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16692 to 15530. [2019-12-27 05:35:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15530 states. [2019-12-27 05:35:04,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15530 states to 15530 states and 48120 transitions. [2019-12-27 05:35:04,993 INFO L78 Accepts]: Start accepts. Automaton has 15530 states and 48120 transitions. Word has length 59 [2019-12-27 05:35:04,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:35:04,993 INFO L462 AbstractCegarLoop]: Abstraction has 15530 states and 48120 transitions. [2019-12-27 05:35:04,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:35:04,993 INFO L276 IsEmpty]: Start isEmpty. Operand 15530 states and 48120 transitions. [2019-12-27 05:35:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 05:35:05,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:35:05,010 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] [2019-12-27 05:35:05,010 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:35:05,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:35:05,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1628182047, now seen corresponding path program 5 times [2019-12-27 05:35:05,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:35:05,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940013112] [2019-12-27 05:35:05,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:35:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:35:05,312 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 05:35:05,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940013112] [2019-12-27 05:35:05,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:35:05,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 05:35:05,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903235741] [2019-12-27 05:35:05,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 05:35:05,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:35:05,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 05:35:05,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:35:05,314 INFO L87 Difference]: Start difference. First operand 15530 states and 48120 transitions. Second operand 13 states. [2019-12-27 05:35:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:35:06,061 INFO L93 Difference]: Finished difference Result 16784 states and 51494 transitions. [2019-12-27 05:35:06,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 05:35:06,061 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-12-27 05:35:06,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:35:06,085 INFO L225 Difference]: With dead ends: 16784 [2019-12-27 05:35:06,086 INFO L226 Difference]: Without dead ends: 16380 [2019-12-27 05:35:06,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-12-27 05:35:06,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16380 states. [2019-12-27 05:35:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16380 to 15232. [2019-12-27 05:35:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15232 states. [2019-12-27 05:35:06,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15232 states to 15232 states and 47344 transitions. [2019-12-27 05:35:06,320 INFO L78 Accepts]: Start accepts. Automaton has 15232 states and 47344 transitions. Word has length 59 [2019-12-27 05:35:06,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:35:06,320 INFO L462 AbstractCegarLoop]: Abstraction has 15232 states and 47344 transitions. [2019-12-27 05:35:06,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 05:35:06,320 INFO L276 IsEmpty]: Start isEmpty. Operand 15232 states and 47344 transitions. [2019-12-27 05:35:06,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 05:35:06,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:35:06,336 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] [2019-12-27 05:35:06,336 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:35:06,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:35:06,336 INFO L82 PathProgramCache]: Analyzing trace with hash 317629459, now seen corresponding path program 6 times [2019-12-27 05:35:06,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:35:06,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941453296] [2019-12-27 05:35:06,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:35:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:35:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:35:06,468 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:35:06,469 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:35:06,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_79| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~y$r_buff0_thd1~0_7 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_p3_EAX~0_15) (= 0 v_~y$w_buff1~0_26) (= v_~y~0_25 0) (= |v_#valid_77| (store .cse0 |v_ULTIMATE.start_main_~#t437~0.base_22| 1)) (= 0 v_~__unbuffered_p0_EAX~0_15) (= v_~main$tmp_guard0~0_9 0) (= v_~y$r_buff0_thd3~0_24 0) (= |v_#NULL.offset_6| 0) (= |v_ULTIMATE.start_main_~#t437~0.offset_17| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_66 0) (= 0 v_~y$flush_delayed~0_14) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t437~0.base_22| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t437~0.base_22|) |v_ULTIMATE.start_main_~#t437~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_cnt~0_26) (= v_~y$r_buff1_thd1~0_8 0) (= v_~y$r_buff0_thd0~0_19 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t437~0.base_22| 4) |v_#length_31|) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t437~0.base_22|) (= 0 v_~y$r_buff1_thd0~0_21) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p3_EBX~0_15) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~weak$$choice2~0_35) (= 0 v_~y$w_buff0~0_27) (= v_~y$w_buff0_used~0_105 0) (= 0 v_~z~0_9) (= 0 v_~y$r_buff1_thd3~0_18) (= v_~a~0_12 0) (= v_~y$mem_tmp~0_10 0) (= v_~y$r_buff0_thd4~0_19 0) (= v_~x~0_12 0) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$r_buff1_thd2~0_42) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t437~0.base_22|)) (= 0 v_~y$r_buff1_thd4~0_18))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_79|, #memory_int=|v_#memory_int_22|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t438~0.offset=|v_ULTIMATE.start_main_~#t438~0.offset_17|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_22|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_12, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ULTIMATE.start_main_~#t440~0.offset=|v_ULTIMATE.start_main_~#t440~0.offset_17|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_15, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ULTIMATE.start_main_~#t439~0.base=|v_ULTIMATE.start_main_~#t439~0.base_20|, ULTIMATE.start_main_~#t438~0.base=|v_ULTIMATE.start_main_~#t438~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t437~0.offset=|v_ULTIMATE.start_main_~#t437~0.offset_17|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_66, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_21, ~x~0=v_~x~0_12, ULTIMATE.start_main_~#t440~0.base=|v_ULTIMATE.start_main_~#t440~0.base_21|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t439~0.offset=|v_ULTIMATE.start_main_~#t439~0.offset_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ~y$w_buff0~0=v_~y$w_buff0~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y~0=v_~y~0_25, ULTIMATE.start_main_~#t437~0.base=|v_ULTIMATE.start_main_~#t437~0.base_22|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_15, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_19, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, #valid=|v_#valid_77|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t438~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t440~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t439~0.base, ULTIMATE.start_main_~#t438~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t437~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t440~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t439~0.offset, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t437~0.base, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 05:35:06,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L845-1-->L847: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t438~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t438~0.base_11|) |v_ULTIMATE.start_main_~#t438~0.offset_10| 1)) |v_#memory_int_17|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t438~0.base_11|)) (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t438~0.base_11| 1) |v_#valid_43|) (not (= 0 |v_ULTIMATE.start_main_~#t438~0.base_11|)) (= |v_ULTIMATE.start_main_~#t438~0.offset_10| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t438~0.base_11| 4)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t438~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t438~0.base=|v_ULTIMATE.start_main_~#t438~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t438~0.offset=|v_ULTIMATE.start_main_~#t438~0.offset_10|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t438~0.base, ULTIMATE.start_main_~#t438~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 05:35:06,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L847-1-->L849: Formula: (and (not (= |v_ULTIMATE.start_main_~#t439~0.base_10| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t439~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t439~0.base_10|) |v_ULTIMATE.start_main_~#t439~0.offset_9| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t439~0.base_10|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t439~0.base_10| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t439~0.base_10|) (= |v_ULTIMATE.start_main_~#t439~0.offset_9| 0) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t439~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t439~0.offset=|v_ULTIMATE.start_main_~#t439~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t439~0.base=|v_ULTIMATE.start_main_~#t439~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t439~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t439~0.base] because there is no mapped edge [2019-12-27 05:35:06,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L849-1-->L851: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t440~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t440~0.base_13|) |v_ULTIMATE.start_main_~#t440~0.offset_11| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t440~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t440~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t440~0.base_13| 0)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t440~0.base_13| 4) |v_#length_21|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t440~0.base_13| 1)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t440~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t440~0.base=|v_ULTIMATE.start_main_~#t440~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ULTIMATE.start_main_~#t440~0.offset=|v_ULTIMATE.start_main_~#t440~0.offset_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t440~0.base, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t440~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 05:35:06,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] P2ENTRY-->L4-3: Formula: (and (= (mod ~y$w_buff1_used~0_Out1178105438 256) 0) (= P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out1178105438 |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out1178105438|) (= ~y$w_buff1_used~0_Out1178105438 ~y$w_buff0_used~0_In1178105438) (= |P2Thread1of1ForFork3_#in~arg.base_In1178105438| P2Thread1of1ForFork3_~arg.base_Out1178105438) (= ~y$w_buff0~0_Out1178105438 1) (= 1 |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out1178105438|) (= P2Thread1of1ForFork3_~arg.offset_Out1178105438 |P2Thread1of1ForFork3_#in~arg.offset_In1178105438|) (= ~y$w_buff0~0_In1178105438 ~y$w_buff1~0_Out1178105438) (= ~y$w_buff0_used~0_Out1178105438 1)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1178105438, ~y$w_buff0~0=~y$w_buff0~0_In1178105438, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In1178105438|, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In1178105438|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1178105438, ~y$w_buff1~0=~y$w_buff1~0_Out1178105438, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out1178105438|, ~y$w_buff0~0=~y$w_buff0~0_Out1178105438, P2Thread1of1ForFork3_~arg.base=P2Thread1of1ForFork3_~arg.base_Out1178105438, P2Thread1of1ForFork3___VERIFIER_assert_~expression=P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out1178105438, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In1178105438|, P2Thread1of1ForFork3_~arg.offset=P2Thread1of1ForFork3_~arg.offset_Out1178105438, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In1178105438|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1178105438} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork3_~arg.base, P2Thread1of1ForFork3___VERIFIER_assert_~expression, P2Thread1of1ForFork3_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 05:35:06,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~x~0_7) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_7} OutVars{~a~0=v_~a~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_7, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 05:35:06,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L822-2-->L822-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1280386749 256))) (.cse2 (= |P3Thread1of1ForFork0_#t~ite32_Out1280386749| |P3Thread1of1ForFork0_#t~ite33_Out1280386749|)) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In1280386749 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite32_Out1280386749| ~y~0_In1280386749) (or .cse0 .cse1) .cse2) (and (not .cse1) .cse2 (not .cse0) (= |P3Thread1of1ForFork0_#t~ite32_Out1280386749| ~y$w_buff1~0_In1280386749)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1280386749, ~y$w_buff1~0=~y$w_buff1~0_In1280386749, ~y~0=~y~0_In1280386749, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1280386749} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1280386749, ~y$w_buff1~0=~y$w_buff1~0_In1280386749, ~y~0=~y~0_In1280386749, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out1280386749|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1280386749|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1280386749} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 05:35:06,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In2115752483 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2115752483 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork3_#t~ite28_Out2115752483|) (not .cse1)) (and (= ~y$w_buff0_used~0_In2115752483 |P2Thread1of1ForFork3_#t~ite28_Out2115752483|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2115752483, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2115752483} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2115752483, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2115752483, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out2115752483|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-27 05:35:06,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd4~0_In409026902 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In409026902 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In409026902 |P3Thread1of1ForFork0_#t~ite34_Out409026902|)) (and (not .cse1) (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out409026902|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In409026902, ~y$w_buff0_used~0=~y$w_buff0_used~0_In409026902} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In409026902, ~y$w_buff0_used~0=~y$w_buff0_used~0_In409026902, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out409026902|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 05:35:06,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-266449445 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-266449445 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-266449445 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-266449445 256)))) (or (and (= |P2Thread1of1ForFork3_#t~ite29_Out-266449445| ~y$w_buff1_used~0_In-266449445) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork3_#t~ite29_Out-266449445| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-266449445, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-266449445, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-266449445, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-266449445} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-266449445, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-266449445, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-266449445, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-266449445|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-266449445} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-27 05:35:06,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1659374397 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1659374397| ~y$w_buff0~0_In1659374397) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite8_In1659374397| |P1Thread1of1ForFork2_#t~ite8_Out1659374397|)) (and (= |P1Thread1of1ForFork2_#t~ite8_Out1659374397| |P1Thread1of1ForFork2_#t~ite9_Out1659374397|) (= |P1Thread1of1ForFork2_#t~ite8_Out1659374397| ~y$w_buff0~0_In1659374397) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1659374397 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1659374397 256)) .cse1) (= (mod ~y$w_buff0_used~0_In1659374397 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1659374397 256) 0)))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1659374397, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1659374397, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In1659374397|, ~y$w_buff0~0=~y$w_buff0~0_In1659374397, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1659374397, ~weak$$choice2~0=~weak$$choice2~0_In1659374397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1659374397} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1659374397, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1659374397|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1659374397, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out1659374397|, ~y$w_buff0~0=~y$w_buff0~0_In1659374397, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1659374397, ~weak$$choice2~0=~weak$$choice2~0_In1659374397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1659374397} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 05:35:06,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L764-->L764-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In648715380 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out648715380| |P1Thread1of1ForFork2_#t~ite11_Out648715380|) (= ~y$w_buff1~0_In648715380 |P1Thread1of1ForFork2_#t~ite11_Out648715380|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In648715380 256) 0))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In648715380 256) 0)) (= (mod ~y$w_buff0_used~0_In648715380 256) 0) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In648715380 256) 0)))) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_In648715380| |P1Thread1of1ForFork2_#t~ite11_Out648715380|) (= |P1Thread1of1ForFork2_#t~ite12_Out648715380| ~y$w_buff1~0_In648715380)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In648715380, ~y$w_buff1~0=~y$w_buff1~0_In648715380, ~y$w_buff0_used~0=~y$w_buff0_used~0_In648715380, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In648715380, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In648715380|, ~weak$$choice2~0=~weak$$choice2~0_In648715380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In648715380} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In648715380, ~y$w_buff1~0=~y$w_buff1~0_In648715380, ~y$w_buff0_used~0=~y$w_buff0_used~0_In648715380, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In648715380, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out648715380|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out648715380|, ~weak$$choice2~0=~weak$$choice2~0_In648715380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In648715380} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 05:35:06,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L802-->L803: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1446542332 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1446542332 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1446542332 ~y$r_buff0_thd3~0_Out-1446542332)) (and (not .cse1) (= ~y$r_buff0_thd3~0_Out-1446542332 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1446542332, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1446542332} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-1446542332|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1446542332, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1446542332} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 05:35:06,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L803-->L803-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In85391335 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In85391335 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In85391335 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In85391335 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In85391335 |P2Thread1of1ForFork3_#t~ite31_Out85391335|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork3_#t~ite31_Out85391335| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In85391335, ~y$w_buff0_used~0=~y$w_buff0_used~0_In85391335, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In85391335, ~y$w_buff1_used~0=~y$w_buff1_used~0_In85391335} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In85391335, ~y$w_buff0_used~0=~y$w_buff0_used~0_In85391335, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In85391335, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out85391335|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In85391335} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 05:35:06,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= |v_P2Thread1of1ForFork3_#t~ite31_8| v_~y$r_buff1_thd3~0_13) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 05:35:06,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In760834627 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In760834627 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In760834627 256))) (.cse3 (= (mod ~y$r_buff0_thd4~0_In760834627 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite35_Out760834627| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork0_#t~ite35_Out760834627| ~y$w_buff1_used~0_In760834627)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In760834627, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In760834627, ~y$w_buff0_used~0=~y$w_buff0_used~0_In760834627, ~y$w_buff1_used~0=~y$w_buff1_used~0_In760834627} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In760834627, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In760834627, ~y$w_buff0_used~0=~y$w_buff0_used~0_In760834627, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out760834627|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In760834627} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-27 05:35:06,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In666020483 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In666020483 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite36_Out666020483|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd4~0_In666020483 |P3Thread1of1ForFork0_#t~ite36_Out666020483|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In666020483, ~y$w_buff0_used~0=~y$w_buff0_used~0_In666020483} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In666020483, ~y$w_buff0_used~0=~y$w_buff0_used~0_In666020483, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out666020483|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-27 05:35:06,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In263918599 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In263918599 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd4~0_In263918599 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In263918599 256) 0))) (or (and (= ~y$r_buff1_thd4~0_In263918599 |P3Thread1of1ForFork0_#t~ite37_Out263918599|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork0_#t~ite37_Out263918599|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In263918599, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In263918599, ~y$w_buff0_used~0=~y$w_buff0_used~0_In263918599, ~y$w_buff1_used~0=~y$w_buff1_used~0_In263918599} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In263918599, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In263918599, ~y$w_buff0_used~0=~y$w_buff0_used~0_In263918599, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out263918599|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In263918599} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-27 05:35:06,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L826-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= |v_P3Thread1of1ForFork0_#t~ite37_8| v_~y$r_buff1_thd4~0_13)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:35:06,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-67243437 256)))) (or (and (= ~y$w_buff0_used~0_In-67243437 |P1Thread1of1ForFork2_#t~ite14_Out-67243437|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-67243437 256)))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-67243437 256))) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-67243437 256))) (= 0 (mod ~y$w_buff0_used~0_In-67243437 256)))) (= |P1Thread1of1ForFork2_#t~ite15_Out-67243437| |P1Thread1of1ForFork2_#t~ite14_Out-67243437|) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite14_In-67243437| |P1Thread1of1ForFork2_#t~ite14_Out-67243437|) (= ~y$w_buff0_used~0_In-67243437 |P1Thread1of1ForFork2_#t~ite15_Out-67243437|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-67243437, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-67243437, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-67243437, ~weak$$choice2~0=~weak$$choice2~0_In-67243437, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-67243437|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-67243437} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-67243437, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-67243437, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-67243437, ~weak$$choice2~0=~weak$$choice2~0_In-67243437, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-67243437|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-67243437|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-67243437} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 05:35:06,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L767-->L768: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~y$r_buff0_thd2~0_53 v_~y$r_buff0_thd2~0_52)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 05:35:06,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-665034571 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-665034571 |P1Thread1of1ForFork2_#t~ite24_Out-665034571|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite23_In-665034571| |P1Thread1of1ForFork2_#t~ite23_Out-665034571|)) (and (= ~y$r_buff1_thd2~0_In-665034571 |P1Thread1of1ForFork2_#t~ite23_Out-665034571|) (= |P1Thread1of1ForFork2_#t~ite23_Out-665034571| |P1Thread1of1ForFork2_#t~ite24_Out-665034571|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-665034571 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-665034571 256) 0)) (= (mod ~y$w_buff0_used~0_In-665034571 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-665034571 256))))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-665034571, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-665034571, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-665034571, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-665034571|, ~weak$$choice2~0=~weak$$choice2~0_In-665034571, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-665034571} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-665034571, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-665034571, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-665034571, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-665034571|, ~weak$$choice2~0=~weak$$choice2~0_In-665034571, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-665034571|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-665034571} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 05:35:06,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L770-->L778: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~y~0_16 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~y~0=v_~y~0_16, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 05:35:06,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L851-1-->L857: Formula: (and (= 4 v_~__unbuffered_cnt~0_12) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:35:06,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L857-2-->L857-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-538703647 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-538703647 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-538703647 |ULTIMATE.start_main_#t~ite42_Out-538703647|)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In-538703647 |ULTIMATE.start_main_#t~ite42_Out-538703647|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-538703647, ~y~0=~y~0_In-538703647, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-538703647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-538703647} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-538703647, ~y~0=~y~0_In-538703647, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-538703647|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-538703647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-538703647} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 05:35:06,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L857-4-->L858: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite42_8|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_7|, ~y~0=v_~y~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 05:35:06,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1936061990 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1936061990 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1936061990| ~y$w_buff0_used~0_In1936061990)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1936061990| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1936061990, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1936061990} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1936061990, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1936061990, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1936061990|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 05:35:06,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L859-->L859-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In328413563 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In328413563 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In328413563 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In328413563 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out328413563| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out328413563| ~y$w_buff1_used~0_In328413563) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In328413563, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In328413563, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In328413563, ~y$w_buff1_used~0=~y$w_buff1_used~0_In328413563} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In328413563, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In328413563, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In328413563, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out328413563|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In328413563} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 05:35:06,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L860-->L860-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In727540533 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In727540533 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In727540533 |ULTIMATE.start_main_#t~ite46_Out727540533|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out727540533| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In727540533, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In727540533} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In727540533, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In727540533, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out727540533|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 05:35:06,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L861-->L861-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1309285719 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1309285719 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1309285719 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1309285719 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite47_Out1309285719| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite47_Out1309285719| ~y$r_buff1_thd0~0_In1309285719)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1309285719, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1309285719, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1309285719, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1309285719} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1309285719, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1309285719, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1309285719|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1309285719, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1309285719} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 05:35:06,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 0 v_~__unbuffered_p2_EAX~0_11) (= |v_ULTIMATE.start_main_#t~ite47_17| v_~y$r_buff1_thd0~0_16) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~__unbuffered_p3_EBX~0_11) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~__unbuffered_p0_EAX~0_12) (= 1 v_~__unbuffered_p3_EAX~0_11)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:35:06,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:35:06 BasicIcfg [2019-12-27 05:35:06,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:35:06,609 INFO L168 Benchmark]: Toolchain (without parser) took 154880.95 ms. Allocated memory was 139.5 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 102.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 05:35:06,610 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 05:35:06,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.35 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.2 MB in the beginning and 158.1 MB in the end (delta: -55.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-27 05:35:06,611 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.07 ms. Allocated memory is still 204.5 MB. Free memory was 158.1 MB in the beginning and 154.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 05:35:06,611 INFO L168 Benchmark]: Boogie Preprocessor took 40.78 ms. Allocated memory is still 204.5 MB. Free memory was 154.8 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:35:06,612 INFO L168 Benchmark]: RCFGBuilder took 830.04 ms. Allocated memory is still 204.5 MB. Free memory was 152.9 MB in the beginning and 103.3 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-27 05:35:06,612 INFO L168 Benchmark]: TraceAbstraction took 153144.51 ms. Allocated memory was 204.5 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 102.7 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 05:35:06,615 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.18 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.35 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.2 MB in the beginning and 158.1 MB in the end (delta: -55.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.07 ms. Allocated memory is still 204.5 MB. Free memory was 158.1 MB in the beginning and 154.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.78 ms. Allocated memory is still 204.5 MB. Free memory was 154.8 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 830.04 ms. Allocated memory is still 204.5 MB. Free memory was 152.9 MB in the beginning and 103.3 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 153144.51 ms. Allocated memory was 204.5 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 102.7 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 182 ProgramPointsBefore, 89 ProgramPointsAfterwards, 210 TransitionsBefore, 94 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 28 ChoiceCompositions, 7202 VarBasedMoverChecksPositive, 204 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 74863 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 [L816] 4 __unbuffered_p3_EAX = z [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L755] 2 x = 1 [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L857] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 152.8s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 40.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5021 SDtfs, 9957 SDslu, 19814 SDs, 0 SdLazy, 10936 SolverSat, 652 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 428 GetRequests, 40 SyntacticMatches, 9 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2787 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227200occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 68.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 135572 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1199 NumberOfCodeBlocks, 1199 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1114 ConstructedInterpolants, 0 QuantifiedInterpolants, 299093 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...