/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix049_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:45:19,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:45:19,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:45:19,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:45:19,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:45:19,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:45:19,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:45:19,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:45:19,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:45:19,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:45:19,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:45:19,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:45:19,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:45:19,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:45:19,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:45:19,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:45:19,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:45:19,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:45:19,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:45:19,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:45:19,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:45:19,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:45:19,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:45:19,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:45:19,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:45:19,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:45:19,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:45:19,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:45:19,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:45:19,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:45:19,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:45:19,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:45:19,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:45:19,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:45:19,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:45:19,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:45:19,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:45:19,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:45:19,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:45:19,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:45:19,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:45:19,532 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:45:19,553 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:45:19,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:45:19,555 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:45:19,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:45:19,556 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:45:19,556 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:45:19,556 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:45:19,556 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:45:19,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:45:19,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:45:19,558 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:45:19,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:45:19,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:45:19,559 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:45:19,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:45:19,559 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:45:19,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:45:19,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:45:19,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:45:19,560 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:45:19,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:45:19,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:45:19,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:45:19,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:45:19,561 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:45:19,561 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:45:19,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:45:19,561 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:45:19,562 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:45:19,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:45:19,866 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:45:19,871 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:45:19,872 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:45:19,872 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:45:19,872 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_rmo.opt.i [2019-12-27 02:45:19,948 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20c41a7e9/268b84f48f8b4457a6bedc9dd6a6a3a4/FLAGa35b09473 [2019-12-27 02:45:20,504 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:45:20,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_rmo.opt.i [2019-12-27 02:45:20,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20c41a7e9/268b84f48f8b4457a6bedc9dd6a6a3a4/FLAGa35b09473 [2019-12-27 02:45:20,810 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20c41a7e9/268b84f48f8b4457a6bedc9dd6a6a3a4 [2019-12-27 02:45:20,818 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:45:20,820 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:45:20,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:45:20,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:45:20,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:45:20,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:45:20" (1/1) ... [2019-12-27 02:45:20,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b0d5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:20, skipping insertion in model container [2019-12-27 02:45:20,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:45:20" (1/1) ... [2019-12-27 02:45:20,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:45:20,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:45:21,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:45:21,399 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:45:21,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:45:21,555 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:45:21,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:21 WrapperNode [2019-12-27 02:45:21,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:45:21,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:45:21,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:45:21,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:45:21,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:21" (1/1) ... [2019-12-27 02:45:21,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:21" (1/1) ... [2019-12-27 02:45:21,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:45:21,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:45:21,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:45:21,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:45:21,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:21" (1/1) ... [2019-12-27 02:45:21,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:21" (1/1) ... [2019-12-27 02:45:21,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:21" (1/1) ... [2019-12-27 02:45:21,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:21" (1/1) ... [2019-12-27 02:45:21,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:21" (1/1) ... [2019-12-27 02:45:21,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:21" (1/1) ... [2019-12-27 02:45:21,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:21" (1/1) ... [2019-12-27 02:45:21,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:45:21,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:45:21,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:45:21,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:45:21,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:21" (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 02:45:21,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:45:21,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:45:21,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:45:21,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:45:21,734 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:45:21,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:45:21,736 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:45:21,737 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:45:21,738 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:45:21,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:45:21,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:45:21,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:45:21,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:45:21,743 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 02:45:22,507 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:45:22,508 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:45:22,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:45:22 BoogieIcfgContainer [2019-12-27 02:45:22,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:45:22,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:45:22,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:45:22,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:45:22,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:45:20" (1/3) ... [2019-12-27 02:45:22,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b74ae29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:45:22, skipping insertion in model container [2019-12-27 02:45:22,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:21" (2/3) ... [2019-12-27 02:45:22,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b74ae29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:45:22, skipping insertion in model container [2019-12-27 02:45:22,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:45:22" (3/3) ... [2019-12-27 02:45:22,518 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_rmo.opt.i [2019-12-27 02:45:22,530 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:45:22,530 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:45:22,546 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:45:22,547 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:45:22,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,614 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,614 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,614 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,615 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,615 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,627 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,628 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,644 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,644 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,693 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,695 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,702 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,702 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,703 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,705 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,705 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:22,725 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:45:22,746 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:45:22,746 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:45:22,747 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:45:22,747 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:45:22,747 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:45:22,747 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:45:22,747 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:45:22,747 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:45:22,766 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 02:45:22,768 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 02:45:22,884 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 02:45:22,884 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:45:22,904 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:45:22,926 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 02:45:22,988 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 02:45:22,988 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:45:22,996 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:45:23,017 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 02:45:23,018 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:45:28,307 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 02:45:28,442 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 02:45:28,813 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-27 02:45:28,813 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 02:45:28,817 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-27 02:45:53,356 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-27 02:45:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-27 02:45:53,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:45:53,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:53,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:45:53,365 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:53,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:53,370 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-27 02:45:53,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:53,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181184959] [2019-12-27 02:45:53,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:53,611 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 02:45:53,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181184959] [2019-12-27 02:45:53,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:53,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:45:53,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934105010] [2019-12-27 02:45:53,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:45:53,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:53,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:45:53,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:45:53,640 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-27 02:45:57,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:57,760 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-27 02:45:57,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:45:57,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:45:57,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:58,365 INFO L225 Difference]: With dead ends: 125570 [2019-12-27 02:45:58,365 INFO L226 Difference]: Without dead ends: 111010 [2019-12-27 02:45:58,366 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 02:46:03,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-27 02:46:05,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-27 02:46:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-27 02:46:06,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-27 02:46:06,302 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-27 02:46:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:06,302 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-27 02:46:06,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:46:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-27 02:46:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:46:06,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:06,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:06,311 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:06,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:06,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-27 02:46:06,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:06,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363990903] [2019-12-27 02:46:06,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:06,492 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 02:46:06,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363990903] [2019-12-27 02:46:06,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:06,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:46:06,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136000478] [2019-12-27 02:46:06,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:46:06,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:06,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:46:06,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:46:06,495 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-27 02:46:12,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:12,045 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-27 02:46:12,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:46:12,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:46:12,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:12,782 INFO L225 Difference]: With dead ends: 172646 [2019-12-27 02:46:12,782 INFO L226 Difference]: Without dead ends: 172548 [2019-12-27 02:46:12,783 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 02:46:22,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-27 02:46:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-27 02:46:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-27 02:46:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-27 02:46:25,705 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-27 02:46:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:25,706 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-27 02:46:25,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:46:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-27 02:46:25,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:46:25,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:25,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:25,713 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:25,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:25,713 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-27 02:46:25,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:25,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061635177] [2019-12-27 02:46:25,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:25,762 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 02:46:25,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061635177] [2019-12-27 02:46:25,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:25,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:46:25,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877799814] [2019-12-27 02:46:25,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:46:25,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:25,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:46:25,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:46:25,764 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-27 02:46:25,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:25,900 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-27 02:46:25,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:46:25,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:46:25,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:25,966 INFO L225 Difference]: With dead ends: 34208 [2019-12-27 02:46:25,966 INFO L226 Difference]: Without dead ends: 34208 [2019-12-27 02:46:25,966 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 02:46:26,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-27 02:46:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-27 02:46:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-27 02:46:31,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-27 02:46:31,671 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-27 02:46:31,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:31,671 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-27 02:46:31,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:46:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-27 02:46:31,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:46:31,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:31,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:31,675 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:31,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:31,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-27 02:46:31,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:31,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261581743] [2019-12-27 02:46:31,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:31,731 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 02:46:31,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261581743] [2019-12-27 02:46:31,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:31,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:46:31,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117753727] [2019-12-27 02:46:31,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:46:31,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:31,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:46:31,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:46:31,734 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-27 02:46:31,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:31,912 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-27 02:46:31,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:46:31,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 02:46:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:32,025 INFO L225 Difference]: With dead ends: 51809 [2019-12-27 02:46:32,026 INFO L226 Difference]: Without dead ends: 51809 [2019-12-27 02:46:32,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:46:32,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-27 02:46:32,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-27 02:46:32,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-27 02:46:32,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-27 02:46:32,822 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-27 02:46:32,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:32,823 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-27 02:46:32,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:46:32,823 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-27 02:46:32,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:46:32,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:32,828 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:32,828 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:32,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:32,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-27 02:46:32,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:32,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286036700] [2019-12-27 02:46:32,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:32,933 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 02:46:32,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286036700] [2019-12-27 02:46:32,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:32,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:46:32,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826504491] [2019-12-27 02:46:32,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:46:32,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:32,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:46:32,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:46:32,935 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-27 02:46:33,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:33,518 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-27 02:46:33,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:46:33,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 02:46:33,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:33,612 INFO L225 Difference]: With dead ends: 53507 [2019-12-27 02:46:33,612 INFO L226 Difference]: Without dead ends: 53507 [2019-12-27 02:46:33,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:46:33,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-27 02:46:34,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-27 02:46:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-27 02:46:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-27 02:46:34,985 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-27 02:46:34,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:34,985 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-27 02:46:34,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:46:34,986 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-27 02:46:34,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:46:34,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:35,000 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:35,000 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:35,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:35,000 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-27 02:46:35,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:35,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375706745] [2019-12-27 02:46:35,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:35,136 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 02:46:35,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375706745] [2019-12-27 02:46:35,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:35,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:46:35,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665794900] [2019-12-27 02:46:35,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:46:35,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:35,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:46:35,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:46:35,139 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 6 states. [2019-12-27 02:46:36,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:36,246 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-27 02:46:36,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:46:36,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 02:46:36,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:36,354 INFO L225 Difference]: With dead ends: 66834 [2019-12-27 02:46:36,354 INFO L226 Difference]: Without dead ends: 66820 [2019-12-27 02:46:36,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:46:36,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-27 02:46:37,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-27 02:46:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-27 02:46:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-27 02:46:37,297 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-27 02:46:37,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:37,297 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-27 02:46:37,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:46:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-27 02:46:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:46:37,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:37,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:37,314 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:37,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:37,315 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-27 02:46:37,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:37,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699539584] [2019-12-27 02:46:37,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:37,368 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 02:46:37,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699539584] [2019-12-27 02:46:37,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:37,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:46:37,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36787614] [2019-12-27 02:46:37,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:46:37,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:37,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:46:37,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:46:37,371 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 4 states. [2019-12-27 02:46:37,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:37,462 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-27 02:46:37,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:46:37,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:46:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:37,496 INFO L225 Difference]: With dead ends: 18127 [2019-12-27 02:46:37,496 INFO L226 Difference]: Without dead ends: 18127 [2019-12-27 02:46:37,496 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 02:46:37,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-27 02:46:38,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-27 02:46:38,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-27 02:46:38,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-27 02:46:38,133 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-27 02:46:38,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:38,134 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-27 02:46:38,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:46:38,134 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-27 02:46:38,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:46:38,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:38,147 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] [2019-12-27 02:46:38,147 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:38,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:38,148 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-27 02:46:38,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:38,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410612540] [2019-12-27 02:46:38,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:38,257 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 02:46:38,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410612540] [2019-12-27 02:46:38,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:38,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:46:38,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924383081] [2019-12-27 02:46:38,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:46:38,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:38,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:46:38,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:46:38,259 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-27 02:46:38,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:38,888 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-27 02:46:38,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:46:38,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 02:46:38,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:38,927 INFO L225 Difference]: With dead ends: 25206 [2019-12-27 02:46:38,927 INFO L226 Difference]: Without dead ends: 25206 [2019-12-27 02:46:38,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:46:39,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-27 02:46:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-27 02:46:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-27 02:46:39,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-27 02:46:39,289 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-27 02:46:39,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:39,289 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-27 02:46:39,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:46:39,289 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-27 02:46:39,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:46:39,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:39,312 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] [2019-12-27 02:46:39,312 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:39,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:39,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-27 02:46:39,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:39,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927882196] [2019-12-27 02:46:39,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:39,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 02:46:39,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927882196] [2019-12-27 02:46:39,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:39,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:46:39,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346259834] [2019-12-27 02:46:39,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:46:39,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:39,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:46:39,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:46:39,433 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 7 states. [2019-12-27 02:46:40,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:40,739 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-27 02:46:40,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:46:40,739 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 02:46:40,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:40,783 INFO L225 Difference]: With dead ends: 28185 [2019-12-27 02:46:40,783 INFO L226 Difference]: Without dead ends: 28185 [2019-12-27 02:46:40,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:46:40,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-27 02:46:41,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-27 02:46:41,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-27 02:46:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-27 02:46:41,183 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-27 02:46:41,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:41,183 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-27 02:46:41,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:46:41,184 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-27 02:46:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:46:41,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:41,211 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:41,212 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:41,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:41,212 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-27 02:46:41,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:41,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080042908] [2019-12-27 02:46:41,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:41,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:46:41,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080042908] [2019-12-27 02:46:41,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:41,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:46:41,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528990095] [2019-12-27 02:46:41,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:46:41,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:41,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:46:41,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:46:41,291 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 5 states. [2019-12-27 02:46:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:41,407 INFO L93 Difference]: Finished difference Result 18279 states and 57074 transitions. [2019-12-27 02:46:41,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:46:41,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 02:46:41,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:41,452 INFO L225 Difference]: With dead ends: 18279 [2019-12-27 02:46:41,453 INFO L226 Difference]: Without dead ends: 18279 [2019-12-27 02:46:41,453 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 02:46:41,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18279 states. [2019-12-27 02:46:41,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18279 to 17698. [2019-12-27 02:46:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17698 states. [2019-12-27 02:46:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17698 states to 17698 states and 55505 transitions. [2019-12-27 02:46:41,942 INFO L78 Accepts]: Start accepts. Automaton has 17698 states and 55505 transitions. Word has length 39 [2019-12-27 02:46:41,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:41,942 INFO L462 AbstractCegarLoop]: Abstraction has 17698 states and 55505 transitions. [2019-12-27 02:46:41,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:46:41,943 INFO L276 IsEmpty]: Start isEmpty. Operand 17698 states and 55505 transitions. [2019-12-27 02:46:41,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:46:41,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:41,978 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:41,979 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:41,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:41,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2116688157, now seen corresponding path program 1 times [2019-12-27 02:46:41,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:41,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037551078] [2019-12-27 02:46:41,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:42,146 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 02:46:42,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037551078] [2019-12-27 02:46:42,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:42,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:46:42,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69655240] [2019-12-27 02:46:42,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:46:42,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:42,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:46:42,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:46:42,150 INFO L87 Difference]: Start difference. First operand 17698 states and 55505 transitions. Second operand 7 states. [2019-12-27 02:46:42,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:42,844 INFO L93 Difference]: Finished difference Result 48537 states and 151835 transitions. [2019-12-27 02:46:42,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:46:42,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:46:42,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:42,897 INFO L225 Difference]: With dead ends: 48537 [2019-12-27 02:46:42,898 INFO L226 Difference]: Without dead ends: 38006 [2019-12-27 02:46:42,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:46:43,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38006 states. [2019-12-27 02:46:43,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38006 to 21047. [2019-12-27 02:46:43,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21047 states. [2019-12-27 02:46:43,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21047 states to 21047 states and 66538 transitions. [2019-12-27 02:46:43,382 INFO L78 Accepts]: Start accepts. Automaton has 21047 states and 66538 transitions. Word has length 64 [2019-12-27 02:46:43,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:43,382 INFO L462 AbstractCegarLoop]: Abstraction has 21047 states and 66538 transitions. [2019-12-27 02:46:43,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:46:43,382 INFO L276 IsEmpty]: Start isEmpty. Operand 21047 states and 66538 transitions. [2019-12-27 02:46:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:46:43,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:43,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:43,407 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:43,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:43,407 INFO L82 PathProgramCache]: Analyzing trace with hash -978914267, now seen corresponding path program 2 times [2019-12-27 02:46:43,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:43,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290577146] [2019-12-27 02:46:43,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:43,505 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 02:46:43,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290577146] [2019-12-27 02:46:43,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:43,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:46:43,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148193738] [2019-12-27 02:46:43,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:46:43,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:43,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:46:43,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:46:43,507 INFO L87 Difference]: Start difference. First operand 21047 states and 66538 transitions. Second operand 7 states. [2019-12-27 02:46:43,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:43,970 INFO L93 Difference]: Finished difference Result 57554 states and 178145 transitions. [2019-12-27 02:46:43,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:46:43,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:46:43,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:44,028 INFO L225 Difference]: With dead ends: 57554 [2019-12-27 02:46:44,028 INFO L226 Difference]: Without dead ends: 41745 [2019-12-27 02:46:44,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:46:44,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41745 states. [2019-12-27 02:46:44,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41745 to 24743. [2019-12-27 02:46:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24743 states. [2019-12-27 02:46:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24743 states to 24743 states and 78318 transitions. [2019-12-27 02:46:44,557 INFO L78 Accepts]: Start accepts. Automaton has 24743 states and 78318 transitions. Word has length 64 [2019-12-27 02:46:44,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:44,558 INFO L462 AbstractCegarLoop]: Abstraction has 24743 states and 78318 transitions. [2019-12-27 02:46:44,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:46:44,558 INFO L276 IsEmpty]: Start isEmpty. Operand 24743 states and 78318 transitions. [2019-12-27 02:46:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:46:44,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:46:44,590 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:44,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:44,590 INFO L82 PathProgramCache]: Analyzing trace with hash -423923923, now seen corresponding path program 3 times [2019-12-27 02:46:44,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:44,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463976406] [2019-12-27 02:46:44,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:44,680 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 02:46:44,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463976406] [2019-12-27 02:46:44,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:44,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:46:44,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056600672] [2019-12-27 02:46:44,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:46:44,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:44,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:46:44,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:46:44,683 INFO L87 Difference]: Start difference. First operand 24743 states and 78318 transitions. Second operand 7 states. [2019-12-27 02:46:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:45,125 INFO L93 Difference]: Finished difference Result 51247 states and 161421 transitions. [2019-12-27 02:46:45,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 02:46:45,125 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:46:45,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:45,200 INFO L225 Difference]: With dead ends: 51247 [2019-12-27 02:46:45,200 INFO L226 Difference]: Without dead ends: 47407 [2019-12-27 02:46:45,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:46:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47407 states. [2019-12-27 02:46:46,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47407 to 24923. [2019-12-27 02:46:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24923 states. [2019-12-27 02:46:46,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24923 states to 24923 states and 79050 transitions. [2019-12-27 02:46:46,118 INFO L78 Accepts]: Start accepts. Automaton has 24923 states and 79050 transitions. Word has length 64 [2019-12-27 02:46:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:46,118 INFO L462 AbstractCegarLoop]: Abstraction has 24923 states and 79050 transitions. [2019-12-27 02:46:46,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:46:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 24923 states and 79050 transitions. [2019-12-27 02:46:46,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:46:46,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:46,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:46,158 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:46,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:46,159 INFO L82 PathProgramCache]: Analyzing trace with hash -314768521, now seen corresponding path program 4 times [2019-12-27 02:46:46,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:46,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197797798] [2019-12-27 02:46:46,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:46,237 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 02:46:46,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197797798] [2019-12-27 02:46:46,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:46,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:46:46,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545575303] [2019-12-27 02:46:46,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:46:46,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:46,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:46:46,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:46:46,239 INFO L87 Difference]: Start difference. First operand 24923 states and 79050 transitions. Second operand 3 states. [2019-12-27 02:46:46,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:46,332 INFO L93 Difference]: Finished difference Result 20919 states and 64986 transitions. [2019-12-27 02:46:46,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:46:46,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 02:46:46,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:46,370 INFO L225 Difference]: With dead ends: 20919 [2019-12-27 02:46:46,370 INFO L226 Difference]: Without dead ends: 20919 [2019-12-27 02:46:46,370 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 02:46:46,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20919 states. [2019-12-27 02:46:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20919 to 19827. [2019-12-27 02:46:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-12-27 02:46:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 61272 transitions. [2019-12-27 02:46:46,680 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 61272 transitions. Word has length 64 [2019-12-27 02:46:46,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:46,680 INFO L462 AbstractCegarLoop]: Abstraction has 19827 states and 61272 transitions. [2019-12-27 02:46:46,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:46:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 61272 transitions. [2019-12-27 02:46:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:46:46,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:46,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:46,701 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:46,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:46,702 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-27 02:46:46,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:46,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533326014] [2019-12-27 02:46:46,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:46,763 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 02:46:46,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533326014] [2019-12-27 02:46:46,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:46,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:46:46,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481592636] [2019-12-27 02:46:46,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:46:46,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:46,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:46:46,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:46:46,765 INFO L87 Difference]: Start difference. First operand 19827 states and 61272 transitions. Second operand 3 states. [2019-12-27 02:46:46,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:46,905 INFO L93 Difference]: Finished difference Result 24197 states and 74265 transitions. [2019-12-27 02:46:46,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:46:46,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:46:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:46,947 INFO L225 Difference]: With dead ends: 24197 [2019-12-27 02:46:46,947 INFO L226 Difference]: Without dead ends: 24197 [2019-12-27 02:46:46,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:46:47,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24197 states. [2019-12-27 02:46:47,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24197 to 21036. [2019-12-27 02:46:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21036 states. [2019-12-27 02:46:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 65069 transitions. [2019-12-27 02:46:47,382 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 65069 transitions. Word has length 65 [2019-12-27 02:46:47,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:47,382 INFO L462 AbstractCegarLoop]: Abstraction has 21036 states and 65069 transitions. [2019-12-27 02:46:47,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:46:47,383 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 65069 transitions. [2019-12-27 02:46:47,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:46:47,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:47,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:47,406 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:47,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:47,406 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-27 02:46:47,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:47,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319067463] [2019-12-27 02:46:47,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:47,483 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 02:46:47,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319067463] [2019-12-27 02:46:47,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:47,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:46:47,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120460567] [2019-12-27 02:46:47,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:46:47,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:47,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:46:47,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:46:47,486 INFO L87 Difference]: Start difference. First operand 21036 states and 65069 transitions. Second operand 4 states. [2019-12-27 02:46:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:47,626 INFO L93 Difference]: Finished difference Result 24621 states and 75632 transitions. [2019-12-27 02:46:47,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:46:47,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 02:46:47,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:47,659 INFO L225 Difference]: With dead ends: 24621 [2019-12-27 02:46:47,659 INFO L226 Difference]: Without dead ends: 24621 [2019-12-27 02:46:47,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:46:47,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24621 states. [2019-12-27 02:46:47,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24621 to 21144. [2019-12-27 02:46:47,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21144 states. [2019-12-27 02:46:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21144 states to 21144 states and 65300 transitions. [2019-12-27 02:46:48,009 INFO L78 Accepts]: Start accepts. Automaton has 21144 states and 65300 transitions. Word has length 66 [2019-12-27 02:46:48,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:48,009 INFO L462 AbstractCegarLoop]: Abstraction has 21144 states and 65300 transitions. [2019-12-27 02:46:48,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:46:48,009 INFO L276 IsEmpty]: Start isEmpty. Operand 21144 states and 65300 transitions. [2019-12-27 02:46:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:46:48,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:48,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:48,033 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:48,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:48,033 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-27 02:46:48,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:48,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784345997] [2019-12-27 02:46:48,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:48,278 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 02:46:48,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784345997] [2019-12-27 02:46:48,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:48,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:46:48,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709904257] [2019-12-27 02:46:48,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:46:48,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:48,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:46:48,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:46:48,281 INFO L87 Difference]: Start difference. First operand 21144 states and 65300 transitions. Second operand 11 states. [2019-12-27 02:46:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:51,995 INFO L93 Difference]: Finished difference Result 41689 states and 125014 transitions. [2019-12-27 02:46:51,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 02:46:51,996 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 02:46:51,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:52,058 INFO L225 Difference]: With dead ends: 41689 [2019-12-27 02:46:52,058 INFO L226 Difference]: Without dead ends: 41393 [2019-12-27 02:46:52,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=335, Invalid=1645, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 02:46:52,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41393 states. [2019-12-27 02:46:52,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41393 to 29462. [2019-12-27 02:46:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29462 states. [2019-12-27 02:46:52,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29462 states to 29462 states and 90411 transitions. [2019-12-27 02:46:52,618 INFO L78 Accepts]: Start accepts. Automaton has 29462 states and 90411 transitions. Word has length 66 [2019-12-27 02:46:52,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:52,619 INFO L462 AbstractCegarLoop]: Abstraction has 29462 states and 90411 transitions. [2019-12-27 02:46:52,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:46:52,619 INFO L276 IsEmpty]: Start isEmpty. Operand 29462 states and 90411 transitions. [2019-12-27 02:46:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:46:52,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:52,648 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:52,648 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:52,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:52,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1045060168, now seen corresponding path program 2 times [2019-12-27 02:46:52,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:52,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623565600] [2019-12-27 02:46:52,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:52,754 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 02:46:52,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623565600] [2019-12-27 02:46:52,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:52,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:46:52,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315839243] [2019-12-27 02:46:52,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:46:52,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:52,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:46:52,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:46:52,756 INFO L87 Difference]: Start difference. First operand 29462 states and 90411 transitions. Second operand 7 states. [2019-12-27 02:46:53,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:53,956 INFO L93 Difference]: Finished difference Result 42278 states and 127610 transitions. [2019-12-27 02:46:53,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 02:46:53,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 02:46:53,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:54,014 INFO L225 Difference]: With dead ends: 42278 [2019-12-27 02:46:54,015 INFO L226 Difference]: Without dead ends: 42278 [2019-12-27 02:46:54,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:46:54,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42278 states. [2019-12-27 02:46:54,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42278 to 33818. [2019-12-27 02:46:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33818 states. [2019-12-27 02:46:54,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33818 states to 33818 states and 103224 transitions. [2019-12-27 02:46:54,618 INFO L78 Accepts]: Start accepts. Automaton has 33818 states and 103224 transitions. Word has length 66 [2019-12-27 02:46:54,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:54,618 INFO L462 AbstractCegarLoop]: Abstraction has 33818 states and 103224 transitions. [2019-12-27 02:46:54,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:46:54,619 INFO L276 IsEmpty]: Start isEmpty. Operand 33818 states and 103224 transitions. [2019-12-27 02:46:54,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:46:54,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:54,655 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:54,655 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:54,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:54,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1265900300, now seen corresponding path program 3 times [2019-12-27 02:46:54,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:54,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538770727] [2019-12-27 02:46:54,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:54,766 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 02:46:54,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538770727] [2019-12-27 02:46:54,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:54,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:46:54,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379817179] [2019-12-27 02:46:54,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:46:54,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:54,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:46:54,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:46:54,768 INFO L87 Difference]: Start difference. First operand 33818 states and 103224 transitions. Second operand 8 states. [2019-12-27 02:46:57,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:57,392 INFO L93 Difference]: Finished difference Result 41252 states and 124345 transitions. [2019-12-27 02:46:57,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 02:46:57,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 02:46:57,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:57,448 INFO L225 Difference]: With dead ends: 41252 [2019-12-27 02:46:57,448 INFO L226 Difference]: Without dead ends: 41252 [2019-12-27 02:46:57,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-27 02:46:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41252 states. [2019-12-27 02:46:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41252 to 30631. [2019-12-27 02:46:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30631 states. [2019-12-27 02:46:58,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30631 states to 30631 states and 93699 transitions. [2019-12-27 02:46:58,016 INFO L78 Accepts]: Start accepts. Automaton has 30631 states and 93699 transitions. Word has length 66 [2019-12-27 02:46:58,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:58,017 INFO L462 AbstractCegarLoop]: Abstraction has 30631 states and 93699 transitions. [2019-12-27 02:46:58,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:46:58,017 INFO L276 IsEmpty]: Start isEmpty. Operand 30631 states and 93699 transitions. [2019-12-27 02:46:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:46:58,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:58,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:58,052 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:58,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:58,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1293570610, now seen corresponding path program 4 times [2019-12-27 02:46:58,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:58,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278547718] [2019-12-27 02:46:58,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:58,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:46:58,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278547718] [2019-12-27 02:46:58,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:58,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:46:58,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157177171] [2019-12-27 02:46:58,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:46:58,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:58,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:46:58,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:46:58,187 INFO L87 Difference]: Start difference. First operand 30631 states and 93699 transitions. Second operand 9 states. [2019-12-27 02:47:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:00,877 INFO L93 Difference]: Finished difference Result 37762 states and 113617 transitions. [2019-12-27 02:47:00,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 02:47:00,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 02:47:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:00,930 INFO L225 Difference]: With dead ends: 37762 [2019-12-27 02:47:00,930 INFO L226 Difference]: Without dead ends: 37762 [2019-12-27 02:47:00,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=1607, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 02:47:01,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37762 states. [2019-12-27 02:47:01,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37762 to 25619. [2019-12-27 02:47:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25619 states. [2019-12-27 02:47:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25619 states to 25619 states and 78886 transitions. [2019-12-27 02:47:01,423 INFO L78 Accepts]: Start accepts. Automaton has 25619 states and 78886 transitions. Word has length 66 [2019-12-27 02:47:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:01,423 INFO L462 AbstractCegarLoop]: Abstraction has 25619 states and 78886 transitions. [2019-12-27 02:47:01,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:47:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 25619 states and 78886 transitions. [2019-12-27 02:47:01,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:47:01,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:01,452 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:47:01,452 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:01,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:01,452 INFO L82 PathProgramCache]: Analyzing trace with hash -643939670, now seen corresponding path program 5 times [2019-12-27 02:47:01,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:01,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930619172] [2019-12-27 02:47:01,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:01,819 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 02:47:01,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930619172] [2019-12-27 02:47:01,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:01,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:47:01,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671948667] [2019-12-27 02:47:01,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:47:01,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:01,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:47:01,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:47:01,821 INFO L87 Difference]: Start difference. First operand 25619 states and 78886 transitions. Second operand 11 states. [2019-12-27 02:47:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:03,460 INFO L93 Difference]: Finished difference Result 62427 states and 191449 transitions. [2019-12-27 02:47:03,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 02:47:03,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 02:47:03,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:03,546 INFO L225 Difference]: With dead ends: 62427 [2019-12-27 02:47:03,546 INFO L226 Difference]: Without dead ends: 57834 [2019-12-27 02:47:03,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 02:47:03,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57834 states. [2019-12-27 02:47:04,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57834 to 31419. [2019-12-27 02:47:04,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31419 states. [2019-12-27 02:47:04,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31419 states to 31419 states and 96658 transitions. [2019-12-27 02:47:04,245 INFO L78 Accepts]: Start accepts. Automaton has 31419 states and 96658 transitions. Word has length 66 [2019-12-27 02:47:04,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:04,245 INFO L462 AbstractCegarLoop]: Abstraction has 31419 states and 96658 transitions. [2019-12-27 02:47:04,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:47:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 31419 states and 96658 transitions. [2019-12-27 02:47:04,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:47:04,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:04,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:47:04,281 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:04,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:04,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1351919536, now seen corresponding path program 6 times [2019-12-27 02:47:04,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:04,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359037605] [2019-12-27 02:47:04,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:04,586 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 02:47:04,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359037605] [2019-12-27 02:47:04,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:04,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:47:04,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482439245] [2019-12-27 02:47:04,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:47:04,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:04,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:47:04,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:47:04,588 INFO L87 Difference]: Start difference. First operand 31419 states and 96658 transitions. Second operand 11 states. [2019-12-27 02:47:05,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:05,799 INFO L93 Difference]: Finished difference Result 58837 states and 179312 transitions. [2019-12-27 02:47:05,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:47:05,799 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 02:47:05,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:05,867 INFO L225 Difference]: With dead ends: 58837 [2019-12-27 02:47:05,867 INFO L226 Difference]: Without dead ends: 46985 [2019-12-27 02:47:05,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:47:06,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46985 states. [2019-12-27 02:47:06,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46985 to 25265. [2019-12-27 02:47:06,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25265 states. [2019-12-27 02:47:06,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25265 states to 25265 states and 77086 transitions. [2019-12-27 02:47:06,427 INFO L78 Accepts]: Start accepts. Automaton has 25265 states and 77086 transitions. Word has length 66 [2019-12-27 02:47:06,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:06,427 INFO L462 AbstractCegarLoop]: Abstraction has 25265 states and 77086 transitions. [2019-12-27 02:47:06,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:47:06,427 INFO L276 IsEmpty]: Start isEmpty. Operand 25265 states and 77086 transitions. [2019-12-27 02:47:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:47:06,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:06,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:47:06,454 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:06,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:06,454 INFO L82 PathProgramCache]: Analyzing trace with hash 771622506, now seen corresponding path program 7 times [2019-12-27 02:47:06,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:06,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024001405] [2019-12-27 02:47:06,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:06,665 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 02:47:06,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024001405] [2019-12-27 02:47:06,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:06,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:47:06,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171720972] [2019-12-27 02:47:06,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:47:06,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:06,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:47:06,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:47:06,670 INFO L87 Difference]: Start difference. First operand 25265 states and 77086 transitions. Second operand 10 states. [2019-12-27 02:47:08,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:08,486 INFO L93 Difference]: Finished difference Result 36786 states and 111342 transitions. [2019-12-27 02:47:08,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:47:08,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 02:47:08,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:08,537 INFO L225 Difference]: With dead ends: 36786 [2019-12-27 02:47:08,537 INFO L226 Difference]: Without dead ends: 35554 [2019-12-27 02:47:08,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:47:08,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35554 states. [2019-12-27 02:47:08,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35554 to 24865. [2019-12-27 02:47:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24865 states. [2019-12-27 02:47:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24865 states to 24865 states and 75935 transitions. [2019-12-27 02:47:09,022 INFO L78 Accepts]: Start accepts. Automaton has 24865 states and 75935 transitions. Word has length 66 [2019-12-27 02:47:09,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:09,022 INFO L462 AbstractCegarLoop]: Abstraction has 24865 states and 75935 transitions. [2019-12-27 02:47:09,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:47:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 24865 states and 75935 transitions. [2019-12-27 02:47:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:47:09,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:09,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:47:09,050 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:09,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:09,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1527279588, now seen corresponding path program 8 times [2019-12-27 02:47:09,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:09,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738256552] [2019-12-27 02:47:09,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:09,113 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 02:47:09,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738256552] [2019-12-27 02:47:09,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:09,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:47:09,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274669800] [2019-12-27 02:47:09,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:47:09,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:09,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:47:09,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:47:09,115 INFO L87 Difference]: Start difference. First operand 24865 states and 75935 transitions. Second operand 3 states. [2019-12-27 02:47:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:09,228 INFO L93 Difference]: Finished difference Result 24865 states and 75934 transitions. [2019-12-27 02:47:09,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:47:09,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 02:47:09,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:09,277 INFO L225 Difference]: With dead ends: 24865 [2019-12-27 02:47:09,277 INFO L226 Difference]: Without dead ends: 24865 [2019-12-27 02:47:09,278 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 02:47:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24865 states. [2019-12-27 02:47:09,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24865 to 20707. [2019-12-27 02:47:09,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20707 states. [2019-12-27 02:47:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20707 states to 20707 states and 63945 transitions. [2019-12-27 02:47:09,673 INFO L78 Accepts]: Start accepts. Automaton has 20707 states and 63945 transitions. Word has length 66 [2019-12-27 02:47:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:09,674 INFO L462 AbstractCegarLoop]: Abstraction has 20707 states and 63945 transitions. [2019-12-27 02:47:09,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:47:09,674 INFO L276 IsEmpty]: Start isEmpty. Operand 20707 states and 63945 transitions. [2019-12-27 02:47:09,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:47:09,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:09,698 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:47:09,698 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:09,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:09,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1839052324, now seen corresponding path program 1 times [2019-12-27 02:47:09,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:09,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743480007] [2019-12-27 02:47:09,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:09,925 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 02:47:09,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743480007] [2019-12-27 02:47:09,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:09,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:47:09,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948589532] [2019-12-27 02:47:09,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:47:09,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:09,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:47:09,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:47:09,927 INFO L87 Difference]: Start difference. First operand 20707 states and 63945 transitions. Second operand 11 states. [2019-12-27 02:47:11,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:11,064 INFO L93 Difference]: Finished difference Result 37392 states and 115230 transitions. [2019-12-27 02:47:11,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 02:47:11,065 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:47:11,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:11,121 INFO L225 Difference]: With dead ends: 37392 [2019-12-27 02:47:11,121 INFO L226 Difference]: Without dead ends: 36949 [2019-12-27 02:47:11,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-27 02:47:11,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36949 states. [2019-12-27 02:47:11,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36949 to 20439. [2019-12-27 02:47:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20439 states. [2019-12-27 02:47:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20439 states to 20439 states and 63257 transitions. [2019-12-27 02:47:11,569 INFO L78 Accepts]: Start accepts. Automaton has 20439 states and 63257 transitions. Word has length 67 [2019-12-27 02:47:11,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:11,570 INFO L462 AbstractCegarLoop]: Abstraction has 20439 states and 63257 transitions. [2019-12-27 02:47:11,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:47:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 20439 states and 63257 transitions. [2019-12-27 02:47:11,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:47:11,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:47:11,590 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:11,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:11,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 2 times [2019-12-27 02:47:11,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:11,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376230414] [2019-12-27 02:47:11,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:47:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:47:11,716 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:47:11,716 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:47:11,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= v_~main$tmp_guard1~0_48 0) (= 0 v_~z$r_buff0_thd3~0_416) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1312~0.base_23| 4)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1312~0.base_23|) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1312~0.base_23| 1)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1312~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1312~0.base_23|) |v_ULTIMATE.start_main_~#t1312~0.offset_17| 0)) |v_#memory_int_17|) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1312~0.base_23|) 0) (= v_~z$w_buff0_used~0_900 0) (= 0 v_~__unbuffered_p0_EAX~0_137) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_170 0) (= |v_ULTIMATE.start_main_~#t1312~0.offset_17| 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1314~0.offset=|v_ULTIMATE.start_main_~#t1314~0.offset_14|, ULTIMATE.start_main_~#t1314~0.base=|v_ULTIMATE.start_main_~#t1314~0.base_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ULTIMATE.start_main_~#t1312~0.base=|v_ULTIMATE.start_main_~#t1312~0.base_23|, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ULTIMATE.start_main_~#t1313~0.base=|v_ULTIMATE.start_main_~#t1313~0.base_19|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~x~0=v_~x~0_129, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1313~0.offset=|v_ULTIMATE.start_main_~#t1313~0.offset_12|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_160, ULTIMATE.start_main_~#t1312~0.offset=|v_ULTIMATE.start_main_~#t1312~0.offset_17|, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1314~0.offset, ULTIMATE.start_main_~#t1314~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1312~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1313~0.base, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1313~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1312~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:47:11,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1313~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1313~0.base_11| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1313~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1313~0.base_11|) |v_ULTIMATE.start_main_~#t1313~0.offset_9| 1))) (= 0 |v_ULTIMATE.start_main_~#t1313~0.offset_9|) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1313~0.base_11| 1)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1313~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1313~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1313~0.offset=|v_ULTIMATE.start_main_~#t1313~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1313~0.base=|v_ULTIMATE.start_main_~#t1313~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1313~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1313~0.base] because there is no mapped edge [2019-12-27 02:47:11,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20 0)) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:47:11,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-984346768 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-984346768 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-984346768| ~z~0_In-984346768)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-984346768| ~z$w_buff1~0_In-984346768)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-984346768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-984346768, ~z$w_buff1~0=~z$w_buff1~0_In-984346768, ~z~0=~z~0_In-984346768} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-984346768|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-984346768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-984346768, ~z$w_buff1~0=~z$w_buff1~0_In-984346768, ~z~0=~z~0_In-984346768} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 02:47:11,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 02:47:11,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1314~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1314~0.base_13|)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1314~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1314~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1314~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1314~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1314~0.base_13|) |v_ULTIMATE.start_main_~#t1314~0.offset_11| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1314~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1314~0.offset=|v_ULTIMATE.start_main_~#t1314~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1314~0.base=|v_ULTIMATE.start_main_~#t1314~0.base_13|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1314~0.offset, ULTIMATE.start_main_~#t1314~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 02:47:11,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1927563288 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1927563288 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out1927563288| ~z$w_buff0_used~0_In1927563288) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1927563288| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1927563288, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1927563288} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1927563288, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1927563288|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1927563288} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 02:47:11,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-211227256 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-211227256 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-211227256 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-211227256 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-211227256|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-211227256 |P1Thread1of1ForFork2_#t~ite12_Out-211227256|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-211227256, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-211227256, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-211227256, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-211227256} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-211227256, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-211227256, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-211227256, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-211227256|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-211227256} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 02:47:11,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In928308575 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In928308575 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out928308575| 0)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In928308575 |P1Thread1of1ForFork2_#t~ite13_Out928308575|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In928308575, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In928308575} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In928308575, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out928308575|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In928308575} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 02:47:11,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1172476487 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_In1172476487| |P2Thread1of1ForFork0_#t~ite26_Out1172476487|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out1172476487| ~z$w_buff0_used~0_In1172476487)) (and (= |P2Thread1of1ForFork0_#t~ite26_Out1172476487| ~z$w_buff0_used~0_In1172476487) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1172476487 256) 0))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1172476487 256))) (= (mod ~z$w_buff0_used~0_In1172476487 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In1172476487 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite26_Out1172476487| |P2Thread1of1ForFork0_#t~ite27_Out1172476487|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1172476487|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1172476487, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1172476487, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1172476487, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1172476487, ~weak$$choice2~0=~weak$$choice2~0_In1172476487} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1172476487|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1172476487|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1172476487, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1172476487, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1172476487, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1172476487, ~weak$$choice2~0=~weak$$choice2~0_In1172476487} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 02:47:11,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 02:47:11,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-78018996 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-78018996 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out-78018996| ~z$w_buff0_used~0_In-78018996) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-78018996| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-78018996, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-78018996} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-78018996|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-78018996, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-78018996} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 02:47:11,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 02:47:11,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2127560640 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out-2127560640| |P2Thread1of1ForFork0_#t~ite38_Out-2127560640|)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-2127560640 256)))) (or (and (or .cse0 .cse1) .cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out-2127560640| ~z~0_In-2127560640)) (and (not .cse0) .cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out-2127560640| ~z$w_buff1~0_In-2127560640) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2127560640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2127560640, ~z$w_buff1~0=~z$w_buff1~0_In-2127560640, ~z~0=~z~0_In-2127560640} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-2127560640|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-2127560640|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2127560640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2127560640, ~z$w_buff1~0=~z$w_buff1~0_In-2127560640, ~z~0=~z~0_In-2127560640} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 02:47:11,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-263889274 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-263889274 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-263889274 |P2Thread1of1ForFork0_#t~ite40_Out-263889274|)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-263889274| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-263889274, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-263889274} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-263889274, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-263889274|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-263889274} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 02:47:11,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-976719178 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-976719178 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-976719178 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-976719178 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-976719178 |P2Thread1of1ForFork0_#t~ite41_Out-976719178|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-976719178|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-976719178, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-976719178, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-976719178, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-976719178} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-976719178, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-976719178, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-976719178, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-976719178, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-976719178|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 02:47:11,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1152365683 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1152365683 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1152365683|)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out1152365683| ~z$r_buff0_thd3~0_In1152365683) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1152365683, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1152365683} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1152365683, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1152365683, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1152365683|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 02:47:11,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-2117009777 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-2117009777 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-2117009777 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2117009777 256)))) (or (and (= ~z$r_buff1_thd3~0_In-2117009777 |P2Thread1of1ForFork0_#t~ite43_Out-2117009777|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite43_Out-2117009777| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2117009777, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2117009777, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2117009777, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2117009777} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-2117009777|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2117009777, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2117009777, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2117009777, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2117009777} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 02:47:11,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_30|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 02:47:11,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In917999270 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In917999270 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In917999270 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In917999270 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out917999270| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In917999270 |P0Thread1of1ForFork1_#t~ite6_Out917999270|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In917999270, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In917999270, ~z$w_buff1_used~0=~z$w_buff1_used~0_In917999270, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In917999270} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In917999270, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out917999270|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In917999270, ~z$w_buff1_used~0=~z$w_buff1_used~0_In917999270, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In917999270} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 02:47:11,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1906166664 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1906166664 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-1906166664 ~z$r_buff0_thd1~0_Out-1906166664)) (and (= ~z$r_buff0_thd1~0_Out-1906166664 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1906166664, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1906166664} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1906166664, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1906166664|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1906166664} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:47:11,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd1~0_In1560936794 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1560936794 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In1560936794 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1560936794 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out1560936794| ~z$r_buff1_thd1~0_In1560936794) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite8_Out1560936794| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1560936794, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1560936794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1560936794, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1560936794} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1560936794|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1560936794, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1560936794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1560936794, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1560936794} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 02:47:11,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_44|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_43|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 02:47:11,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1753166970 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-1753166970 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1753166970 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1753166970 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1753166970|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd2~0_In-1753166970 |P1Thread1of1ForFork2_#t~ite14_Out-1753166970|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1753166970, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1753166970, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1753166970, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1753166970} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1753166970, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1753166970, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1753166970, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1753166970|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1753166970} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 02:47:11,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_34|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_34|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_33|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 02:47:11,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:47:11,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1111217491 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-1111217491| |ULTIMATE.start_main_#t~ite47_Out-1111217491|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1111217491 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In-1111217491 |ULTIMATE.start_main_#t~ite47_Out-1111217491|)) (and (not .cse0) (= ~z$w_buff1~0_In-1111217491 |ULTIMATE.start_main_#t~ite47_Out-1111217491|) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1111217491, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1111217491, ~z$w_buff1~0=~z$w_buff1~0_In-1111217491, ~z~0=~z~0_In-1111217491} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1111217491, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1111217491|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1111217491, ~z$w_buff1~0=~z$w_buff1~0_In-1111217491, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1111217491|, ~z~0=~z~0_In-1111217491} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 02:47:11,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In238844169 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In238844169 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out238844169|) (not .cse1)) (and (= ~z$w_buff0_used~0_In238844169 |ULTIMATE.start_main_#t~ite49_Out238844169|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In238844169, ~z$w_buff0_used~0=~z$w_buff0_used~0_In238844169} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In238844169, ~z$w_buff0_used~0=~z$w_buff0_used~0_In238844169, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out238844169|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 02:47:11,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In380734643 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In380734643 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In380734643 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In380734643 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out380734643|)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In380734643 |ULTIMATE.start_main_#t~ite50_Out380734643|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In380734643, ~z$w_buff0_used~0=~z$w_buff0_used~0_In380734643, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In380734643, ~z$w_buff1_used~0=~z$w_buff1_used~0_In380734643} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out380734643|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In380734643, ~z$w_buff0_used~0=~z$w_buff0_used~0_In380734643, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In380734643, ~z$w_buff1_used~0=~z$w_buff1_used~0_In380734643} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 02:47:11,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-217286909 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-217286909 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-217286909|)) (and (= ~z$r_buff0_thd0~0_In-217286909 |ULTIMATE.start_main_#t~ite51_Out-217286909|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-217286909, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-217286909} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-217286909, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-217286909|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-217286909} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 02:47:11,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In932121072 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In932121072 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In932121072 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In932121072 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out932121072|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In932121072 |ULTIMATE.start_main_#t~ite52_Out932121072|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In932121072, ~z$w_buff0_used~0=~z$w_buff0_used~0_In932121072, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In932121072, ~z$w_buff1_used~0=~z$w_buff1_used~0_In932121072} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out932121072|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In932121072, ~z$w_buff0_used~0=~z$w_buff0_used~0_In932121072, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In932121072, ~z$w_buff1_used~0=~z$w_buff1_used~0_In932121072} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 02:47:11,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:47:11,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:47:11 BasicIcfg [2019-12-27 02:47:11,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:47:11,860 INFO L168 Benchmark]: Toolchain (without parser) took 111040.48 ms. Allocated memory was 137.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 100.7 MB in the beginning and 1.1 GB in the end (delta: -982.8 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 02:47:11,861 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 02:47:11,861 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.40 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 100.5 MB in the beginning and 155.5 MB in the end (delta: -55.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:47:11,862 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.20 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:47:11,862 INFO L168 Benchmark]: Boogie Preprocessor took 39.48 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 150.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:47:11,863 INFO L168 Benchmark]: RCFGBuilder took 856.63 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 100.6 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-27 02:47:11,863 INFO L168 Benchmark]: TraceAbstraction took 109347.88 ms. Allocated memory was 202.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 99.9 MB in the beginning and 1.1 GB in the end (delta: -983.6 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 02:47:11,866 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 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 735.40 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 100.5 MB in the beginning and 155.5 MB in the end (delta: -55.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.20 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.48 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 150.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 856.63 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 100.6 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 109347.88 ms. Allocated memory was 202.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 99.9 MB in the beginning and 1.1 GB in the end (delta: -983.6 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1312, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1313, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1314, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 108.9s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 34.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7173 SDtfs, 7972 SDslu, 26514 SDs, 0 SdLazy, 15199 SolverSat, 294 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 62 SyntacticMatches, 22 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1919 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158936occurred 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: 39.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 259007 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1254 NumberOfCodeBlocks, 1254 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1162 ConstructedInterpolants, 0 QuantifiedInterpolants, 291755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...