/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/mix028_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:00:01,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:00:01,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:00:01,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:00:01,558 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:00:01,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:00:01,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:00:01,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:00:01,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:00:01,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:00:01,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:00:01,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:00:01,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:00:01,568 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:00:01,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:00:01,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:00:01,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:00:01,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:00:01,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:00:01,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:00:01,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:00:01,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:00:01,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:00:01,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:00:01,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:00:01,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:00:01,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:00:01,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:00:01,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:00:01,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:00:01,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:00:01,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:00:01,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:00:01,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:00:01,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:00:01,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:00:01,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:00:01,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:00:01,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:00:01,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:00:01,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:00:01,594 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-18 17:00:01,624 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:00:01,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:00:01,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:00:01,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:00:01,626 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:00:01,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:00:01,627 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:00:01,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:00:01,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:00:01,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:00:01,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:00:01,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:00:01,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:00:01,628 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:00:01,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:00:01,628 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:00:01,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:00:01,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:00:01,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:00:01,629 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:00:01,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:00:01,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:00:01,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:00:01,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:00:01,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:00:01,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:00:01,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:00:01,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:00:01,631 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:00:01,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:00:01,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:00:01,926 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:00:01,928 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:00:01,928 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:00:01,929 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc.i [2019-12-18 17:00:02,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33d315021/359bf09d022f406788a1947bc6ab5449/FLAGe7225a4d8 [2019-12-18 17:00:02,564 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:00:02,565 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.oepc.i [2019-12-18 17:00:02,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33d315021/359bf09d022f406788a1947bc6ab5449/FLAGe7225a4d8 [2019-12-18 17:00:02,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33d315021/359bf09d022f406788a1947bc6ab5449 [2019-12-18 17:00:02,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:00:02,849 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:00:02,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:00:02,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:00:02,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:00:02,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:00:02" (1/1) ... [2019-12-18 17:00:02,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9639fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:02, skipping insertion in model container [2019-12-18 17:00:02,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:00:02" (1/1) ... [2019-12-18 17:00:02,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:00:02,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:00:03,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:00:03,444 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:00:03,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:00:03,620 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:00:03,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:03 WrapperNode [2019-12-18 17:00:03,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:00:03,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:00:03,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:00:03,622 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:00:03,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:03" (1/1) ... [2019-12-18 17:00:03,649 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:03" (1/1) ... [2019-12-18 17:00:03,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:00:03,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:00:03,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:00:03,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:00:03,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:03" (1/1) ... [2019-12-18 17:00:03,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:03" (1/1) ... [2019-12-18 17:00:03,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:03" (1/1) ... [2019-12-18 17:00:03,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:03" (1/1) ... [2019-12-18 17:00:03,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:03" (1/1) ... [2019-12-18 17:00:03,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:03" (1/1) ... [2019-12-18 17:00:03,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:03" (1/1) ... [2019-12-18 17:00:03,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:00:03,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:00:03,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:00:03,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:00:03,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:03" (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-18 17:00:03,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:00:03,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:00:03,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:00:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:00:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:00:03,785 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:00:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:00:03,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:00:03,787 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:00:03,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:00:03,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:00:03,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:00:03,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:00:03,794 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:00:04,632 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:00:04,633 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:00:04,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:00:04 BoogieIcfgContainer [2019-12-18 17:00:04,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:00:04,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:00:04,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:00:04,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:00:04,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:00:02" (1/3) ... [2019-12-18 17:00:04,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc51bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:00:04, skipping insertion in model container [2019-12-18 17:00:04,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:03" (2/3) ... [2019-12-18 17:00:04,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc51bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:00:04, skipping insertion in model container [2019-12-18 17:00:04,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:00:04" (3/3) ... [2019-12-18 17:00:04,643 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_power.oepc.i [2019-12-18 17:00:04,654 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:00:04,654 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:00:04,662 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:00:04,664 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:00:04,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,707 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,708 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,708 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,709 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,709 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,739 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,740 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,753 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,753 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,793 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,794 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,794 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,796 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,797 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,801 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,803 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:04,824 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:00:04,844 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:00:04,845 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:00:04,845 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:00:04,845 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:00:04,845 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:00:04,845 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:00:04,845 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:00:04,846 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:00:04,862 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 17:00:04,864 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 17:00:04,964 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 17:00:04,964 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:00:04,990 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:00:05,015 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 17:00:05,114 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 17:00:05,114 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:00:05,123 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:00:05,146 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 17:00:05,148 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:00:11,004 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 17:00:11,119 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 17:00:11,148 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87070 [2019-12-18 17:00:11,149 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 17:00:11,152 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-18 17:00:29,583 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-18 17:00:29,585 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-18 17:00:29,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 17:00:29,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:29,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 17:00:29,593 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-18 17:00:29,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:29,601 INFO L82 PathProgramCache]: Analyzing trace with hash 911890, now seen corresponding path program 1 times [2019-12-18 17:00:29,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:29,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850109445] [2019-12-18 17:00:29,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:29,828 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-18 17:00:29,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850109445] [2019-12-18 17:00:29,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:29,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:00:29,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477639273] [2019-12-18 17:00:29,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:00:29,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:29,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:00:29,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:00:29,848 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-18 17:00:33,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:33,982 INFO L93 Difference]: Finished difference Result 114158 states and 484836 transitions. [2019-12-18 17:00:33,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:00:33,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 17:00:33,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:34,762 INFO L225 Difference]: With dead ends: 114158 [2019-12-18 17:00:34,762 INFO L226 Difference]: Without dead ends: 107060 [2019-12-18 17:00:34,764 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-18 17:00:39,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107060 states. [2019-12-18 17:00:45,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107060 to 107060. [2019-12-18 17:00:45,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107060 states. [2019-12-18 17:00:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107060 states to 107060 states and 454078 transitions. [2019-12-18 17:00:46,111 INFO L78 Accepts]: Start accepts. Automaton has 107060 states and 454078 transitions. Word has length 3 [2019-12-18 17:00:46,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:46,112 INFO L462 AbstractCegarLoop]: Abstraction has 107060 states and 454078 transitions. [2019-12-18 17:00:46,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:00:46,112 INFO L276 IsEmpty]: Start isEmpty. Operand 107060 states and 454078 transitions. [2019-12-18 17:00:46,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:00:46,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:46,117 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:46,117 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-18 17:00:46,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:46,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1487504284, now seen corresponding path program 1 times [2019-12-18 17:00:46,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:46,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413722637] [2019-12-18 17:00:46,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:46,266 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-18 17:00:46,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413722637] [2019-12-18 17:00:46,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:46,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:00:46,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235316904] [2019-12-18 17:00:46,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:00:46,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:46,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:00:46,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:00:46,270 INFO L87 Difference]: Start difference. First operand 107060 states and 454078 transitions. Second operand 4 states. [2019-12-18 17:00:51,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:51,470 INFO L93 Difference]: Finished difference Result 166396 states and 678148 transitions. [2019-12-18 17:00:51,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:00:51,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 17:00:51,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:52,047 INFO L225 Difference]: With dead ends: 166396 [2019-12-18 17:00:52,047 INFO L226 Difference]: Without dead ends: 166347 [2019-12-18 17:00:52,048 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-18 17:00:57,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166347 states. [2019-12-18 17:01:00,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166347 to 151934. [2019-12-18 17:01:00,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151934 states. [2019-12-18 17:01:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151934 states to 151934 states and 627001 transitions. [2019-12-18 17:01:08,378 INFO L78 Accepts]: Start accepts. Automaton has 151934 states and 627001 transitions. Word has length 11 [2019-12-18 17:01:08,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:08,379 INFO L462 AbstractCegarLoop]: Abstraction has 151934 states and 627001 transitions. [2019-12-18 17:01:08,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:01:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 151934 states and 627001 transitions. [2019-12-18 17:01:08,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:01:08,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:08,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:08,390 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-18 17:01:08,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:08,390 INFO L82 PathProgramCache]: Analyzing trace with hash 881606285, now seen corresponding path program 1 times [2019-12-18 17:01:08,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:08,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301686519] [2019-12-18 17:01:08,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:08,450 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-18 17:01:08,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301686519] [2019-12-18 17:01:08,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:08,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:01:08,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202071349] [2019-12-18 17:01:08,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:01:08,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:08,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:01:08,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:08,453 INFO L87 Difference]: Start difference. First operand 151934 states and 627001 transitions. Second operand 3 states. [2019-12-18 17:01:08,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:08,574 INFO L93 Difference]: Finished difference Result 33114 states and 107084 transitions. [2019-12-18 17:01:08,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:01:08,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:01:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:08,645 INFO L225 Difference]: With dead ends: 33114 [2019-12-18 17:01:08,645 INFO L226 Difference]: Without dead ends: 33114 [2019-12-18 17:01:08,646 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-18 17:01:08,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33114 states. [2019-12-18 17:01:09,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33114 to 33114. [2019-12-18 17:01:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33114 states. [2019-12-18 17:01:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33114 states to 33114 states and 107084 transitions. [2019-12-18 17:01:09,305 INFO L78 Accepts]: Start accepts. Automaton has 33114 states and 107084 transitions. Word has length 13 [2019-12-18 17:01:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:09,306 INFO L462 AbstractCegarLoop]: Abstraction has 33114 states and 107084 transitions. [2019-12-18 17:01:09,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:01:09,306 INFO L276 IsEmpty]: Start isEmpty. Operand 33114 states and 107084 transitions. [2019-12-18 17:01:09,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:01:09,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:09,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:09,310 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-18 17:01:09,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:09,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1702625862, now seen corresponding path program 1 times [2019-12-18 17:01:09,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:09,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225115526] [2019-12-18 17:01:09,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:09,427 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-18 17:01:09,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225115526] [2019-12-18 17:01:09,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:09,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:01:09,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404520711] [2019-12-18 17:01:09,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:01:09,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:09,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:01:09,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:01:09,430 INFO L87 Difference]: Start difference. First operand 33114 states and 107084 transitions. Second operand 4 states. [2019-12-18 17:01:09,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:09,842 INFO L93 Difference]: Finished difference Result 41561 states and 133908 transitions. [2019-12-18 17:01:09,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:01:09,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:01:09,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:09,912 INFO L225 Difference]: With dead ends: 41561 [2019-12-18 17:01:09,912 INFO L226 Difference]: Without dead ends: 41561 [2019-12-18 17:01:09,912 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-18 17:01:11,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41561 states. [2019-12-18 17:01:11,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41561 to 37204. [2019-12-18 17:01:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37204 states. [2019-12-18 17:01:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37204 states to 37204 states and 120245 transitions. [2019-12-18 17:01:11,785 INFO L78 Accepts]: Start accepts. Automaton has 37204 states and 120245 transitions. Word has length 16 [2019-12-18 17:01:11,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:11,786 INFO L462 AbstractCegarLoop]: Abstraction has 37204 states and 120245 transitions. [2019-12-18 17:01:11,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:01:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 37204 states and 120245 transitions. [2019-12-18 17:01:11,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 17:01:11,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:11,797 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-18 17:01:11,797 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-18 17:01:11,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:11,797 INFO L82 PathProgramCache]: Analyzing trace with hash -989401703, now seen corresponding path program 1 times [2019-12-18 17:01:11,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:11,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867840663] [2019-12-18 17:01:11,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:11,917 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-18 17:01:11,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867840663] [2019-12-18 17:01:11,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:11,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:01:11,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159779594] [2019-12-18 17:01:11,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:01:11,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:11,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:01:11,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:01:11,919 INFO L87 Difference]: Start difference. First operand 37204 states and 120245 transitions. Second operand 5 states. [2019-12-18 17:01:12,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:12,581 INFO L93 Difference]: Finished difference Result 47941 states and 152440 transitions. [2019-12-18 17:01:12,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:01:12,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 17:01:12,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:12,660 INFO L225 Difference]: With dead ends: 47941 [2019-12-18 17:01:12,660 INFO L226 Difference]: Without dead ends: 47934 [2019-12-18 17:01:12,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:01:12,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47934 states. [2019-12-18 17:01:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47934 to 36849. [2019-12-18 17:01:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36849 states. [2019-12-18 17:01:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36849 states to 36849 states and 118974 transitions. [2019-12-18 17:01:13,965 INFO L78 Accepts]: Start accepts. Automaton has 36849 states and 118974 transitions. Word has length 22 [2019-12-18 17:01:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:13,966 INFO L462 AbstractCegarLoop]: Abstraction has 36849 states and 118974 transitions. [2019-12-18 17:01:13,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:01:13,966 INFO L276 IsEmpty]: Start isEmpty. Operand 36849 states and 118974 transitions. [2019-12-18 17:01:13,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 17:01:13,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:13,981 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-18 17:01:13,981 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-18 17:01:13,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:13,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2090054503, now seen corresponding path program 1 times [2019-12-18 17:01:13,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:13,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421339463] [2019-12-18 17:01:13,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:14,070 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-18 17:01:14,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421339463] [2019-12-18 17:01:14,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:14,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:01:14,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189354267] [2019-12-18 17:01:14,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:01:14,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:14,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:01:14,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:01:14,073 INFO L87 Difference]: Start difference. First operand 36849 states and 118974 transitions. Second operand 4 states. [2019-12-18 17:01:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:14,151 INFO L93 Difference]: Finished difference Result 15264 states and 46609 transitions. [2019-12-18 17:01:14,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:01:14,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 17:01:14,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:14,179 INFO L225 Difference]: With dead ends: 15264 [2019-12-18 17:01:14,179 INFO L226 Difference]: Without dead ends: 15264 [2019-12-18 17:01:14,180 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-18 17:01:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15264 states. [2019-12-18 17:01:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15264 to 14936. [2019-12-18 17:01:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14936 states. [2019-12-18 17:01:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14936 states to 14936 states and 45673 transitions. [2019-12-18 17:01:14,504 INFO L78 Accepts]: Start accepts. Automaton has 14936 states and 45673 transitions. Word has length 25 [2019-12-18 17:01:14,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:14,504 INFO L462 AbstractCegarLoop]: Abstraction has 14936 states and 45673 transitions. [2019-12-18 17:01:14,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:01:14,504 INFO L276 IsEmpty]: Start isEmpty. Operand 14936 states and 45673 transitions. [2019-12-18 17:01:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:01:14,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:14,516 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-18 17:01:14,516 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-18 17:01:14,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:14,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1906532401, now seen corresponding path program 1 times [2019-12-18 17:01:14,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:14,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63487373] [2019-12-18 17:01:14,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:14,558 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-18 17:01:14,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63487373] [2019-12-18 17:01:14,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:14,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:01:14,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805991534] [2019-12-18 17:01:14,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:01:14,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:14,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:01:14,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:14,561 INFO L87 Difference]: Start difference. First operand 14936 states and 45673 transitions. Second operand 3 states. [2019-12-18 17:01:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:14,674 INFO L93 Difference]: Finished difference Result 21267 states and 63997 transitions. [2019-12-18 17:01:14,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:01:14,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 17:01:14,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:14,705 INFO L225 Difference]: With dead ends: 21267 [2019-12-18 17:01:14,705 INFO L226 Difference]: Without dead ends: 21267 [2019-12-18 17:01:14,705 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-18 17:01:14,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21267 states. [2019-12-18 17:01:14,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21267 to 15790. [2019-12-18 17:01:14,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15790 states. [2019-12-18 17:01:14,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15790 states to 15790 states and 48131 transitions. [2019-12-18 17:01:14,990 INFO L78 Accepts]: Start accepts. Automaton has 15790 states and 48131 transitions. Word has length 27 [2019-12-18 17:01:14,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:14,991 INFO L462 AbstractCegarLoop]: Abstraction has 15790 states and 48131 transitions. [2019-12-18 17:01:14,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:01:14,991 INFO L276 IsEmpty]: Start isEmpty. Operand 15790 states and 48131 transitions. [2019-12-18 17:01:15,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:01:15,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:15,002 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-18 17:01:15,002 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-18 17:01:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:15,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1466938041, now seen corresponding path program 1 times [2019-12-18 17:01:15,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:15,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415627587] [2019-12-18 17:01:15,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:15,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415627587] [2019-12-18 17:01:15,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:15,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:01:15,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673072045] [2019-12-18 17:01:15,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:01:15,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:15,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:01:15,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:01:15,133 INFO L87 Difference]: Start difference. First operand 15790 states and 48131 transitions. Second operand 6 states. [2019-12-18 17:01:16,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:16,229 INFO L93 Difference]: Finished difference Result 40724 states and 122204 transitions. [2019-12-18 17:01:16,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:01:16,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 17:01:16,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:16,289 INFO L225 Difference]: With dead ends: 40724 [2019-12-18 17:01:16,289 INFO L226 Difference]: Without dead ends: 40724 [2019-12-18 17:01:16,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:01:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40724 states. [2019-12-18 17:01:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40724 to 22567. [2019-12-18 17:01:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22567 states. [2019-12-18 17:01:16,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22567 states to 22567 states and 69647 transitions. [2019-12-18 17:01:16,761 INFO L78 Accepts]: Start accepts. Automaton has 22567 states and 69647 transitions. Word has length 27 [2019-12-18 17:01:16,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:16,761 INFO L462 AbstractCegarLoop]: Abstraction has 22567 states and 69647 transitions. [2019-12-18 17:01:16,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:01:16,762 INFO L276 IsEmpty]: Start isEmpty. Operand 22567 states and 69647 transitions. [2019-12-18 17:01:16,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 17:01:16,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:16,779 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:16,779 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-18 17:01:16,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:16,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1177717026, now seen corresponding path program 1 times [2019-12-18 17:01:16,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:16,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891913198] [2019-12-18 17:01:16,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:16,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891913198] [2019-12-18 17:01:16,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:16,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:01:16,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575183751] [2019-12-18 17:01:16,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:01:16,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:16,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:01:16,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:01:16,898 INFO L87 Difference]: Start difference. First operand 22567 states and 69647 transitions. Second operand 6 states. [2019-12-18 17:01:17,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:17,634 INFO L93 Difference]: Finished difference Result 37765 states and 113362 transitions. [2019-12-18 17:01:17,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:01:17,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 17:01:17,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:17,691 INFO L225 Difference]: With dead ends: 37765 [2019-12-18 17:01:17,691 INFO L226 Difference]: Without dead ends: 37765 [2019-12-18 17:01:17,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:01:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37765 states. [2019-12-18 17:01:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37765 to 22218. [2019-12-18 17:01:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22218 states. [2019-12-18 17:01:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22218 states to 22218 states and 68697 transitions. [2019-12-18 17:01:18,521 INFO L78 Accepts]: Start accepts. Automaton has 22218 states and 68697 transitions. Word has length 28 [2019-12-18 17:01:18,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:18,521 INFO L462 AbstractCegarLoop]: Abstraction has 22218 states and 68697 transitions. [2019-12-18 17:01:18,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:01:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 22218 states and 68697 transitions. [2019-12-18 17:01:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:01:18,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:18,547 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-18 17:01:18,547 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-18 17:01:18,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:18,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1088633804, now seen corresponding path program 1 times [2019-12-18 17:01:18,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:18,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456445430] [2019-12-18 17:01:18,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:18,765 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-18 17:01:18,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456445430] [2019-12-18 17:01:18,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:18,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:01:18,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244224774] [2019-12-18 17:01:18,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:01:18,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:18,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:01:18,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:01:18,768 INFO L87 Difference]: Start difference. First operand 22218 states and 68697 transitions. Second operand 7 states. [2019-12-18 17:01:20,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:20,282 INFO L93 Difference]: Finished difference Result 50401 states and 150592 transitions. [2019-12-18 17:01:20,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 17:01:20,283 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 17:01:20,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:20,373 INFO L225 Difference]: With dead ends: 50401 [2019-12-18 17:01:20,373 INFO L226 Difference]: Without dead ends: 50401 [2019-12-18 17:01:20,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-18 17:01:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50401 states. [2019-12-18 17:01:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50401 to 23449. [2019-12-18 17:01:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23449 states. [2019-12-18 17:01:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23449 states to 23449 states and 72523 transitions. [2019-12-18 17:01:20,916 INFO L78 Accepts]: Start accepts. Automaton has 23449 states and 72523 transitions. Word has length 33 [2019-12-18 17:01:20,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:20,916 INFO L462 AbstractCegarLoop]: Abstraction has 23449 states and 72523 transitions. [2019-12-18 17:01:20,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:01:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 23449 states and 72523 transitions. [2019-12-18 17:01:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:01:20,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:20,940 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-18 17:01:20,940 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-18 17:01:20,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:20,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1082826604, now seen corresponding path program 1 times [2019-12-18 17:01:20,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:20,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532983583] [2019-12-18 17:01:20,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:20,977 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-18 17:01:20,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532983583] [2019-12-18 17:01:20,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:20,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:01:20,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398012544] [2019-12-18 17:01:20,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:01:20,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:20,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:01:20,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:20,979 INFO L87 Difference]: Start difference. First operand 23449 states and 72523 transitions. Second operand 3 states. [2019-12-18 17:01:21,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:21,107 INFO L93 Difference]: Finished difference Result 31046 states and 92713 transitions. [2019-12-18 17:01:21,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:01:21,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 17:01:21,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:21,531 INFO L225 Difference]: With dead ends: 31046 [2019-12-18 17:01:21,531 INFO L226 Difference]: Without dead ends: 31046 [2019-12-18 17:01:21,532 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-18 17:01:21,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31046 states. [2019-12-18 17:01:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31046 to 22288. [2019-12-18 17:01:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22288 states. [2019-12-18 17:01:21,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22288 states to 22288 states and 66690 transitions. [2019-12-18 17:01:21,873 INFO L78 Accepts]: Start accepts. Automaton has 22288 states and 66690 transitions. Word has length 33 [2019-12-18 17:01:21,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:21,873 INFO L462 AbstractCegarLoop]: Abstraction has 22288 states and 66690 transitions. [2019-12-18 17:01:21,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:01:21,873 INFO L276 IsEmpty]: Start isEmpty. Operand 22288 states and 66690 transitions. [2019-12-18 17:01:21,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:01:21,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:21,890 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-18 17:01:21,891 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-18 17:01:21,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:21,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1090977820, now seen corresponding path program 2 times [2019-12-18 17:01:21,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:21,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832188433] [2019-12-18 17:01:21,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:22,021 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-18 17:01:22,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832188433] [2019-12-18 17:01:22,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:22,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:01:22,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410857213] [2019-12-18 17:01:22,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:01:22,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:22,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:01:22,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:01:22,023 INFO L87 Difference]: Start difference. First operand 22288 states and 66690 transitions. Second operand 8 states. [2019-12-18 17:01:23,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:23,918 INFO L93 Difference]: Finished difference Result 49099 states and 143360 transitions. [2019-12-18 17:01:23,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 17:01:23,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 17:01:23,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:23,983 INFO L225 Difference]: With dead ends: 49099 [2019-12-18 17:01:23,983 INFO L226 Difference]: Without dead ends: 49099 [2019-12-18 17:01:23,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:01:24,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49099 states. [2019-12-18 17:01:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49099 to 21685. [2019-12-18 17:01:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21685 states. [2019-12-18 17:01:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21685 states to 21685 states and 64891 transitions. [2019-12-18 17:01:24,951 INFO L78 Accepts]: Start accepts. Automaton has 21685 states and 64891 transitions. Word has length 33 [2019-12-18 17:01:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:24,952 INFO L462 AbstractCegarLoop]: Abstraction has 21685 states and 64891 transitions. [2019-12-18 17:01:24,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:01:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 21685 states and 64891 transitions. [2019-12-18 17:01:24,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 17:01:24,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:24,971 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] [2019-12-18 17:01:24,971 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-18 17:01:24,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:24,972 INFO L82 PathProgramCache]: Analyzing trace with hash 791261483, now seen corresponding path program 1 times [2019-12-18 17:01:24,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:24,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095083516] [2019-12-18 17:01:24,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:25,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:25,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095083516] [2019-12-18 17:01:25,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:25,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:01:25,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375237470] [2019-12-18 17:01:25,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:01:25,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:25,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:01:25,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:01:25,152 INFO L87 Difference]: Start difference. First operand 21685 states and 64891 transitions. Second operand 9 states. [2019-12-18 17:01:26,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:26,916 INFO L93 Difference]: Finished difference Result 39456 states and 115299 transitions. [2019-12-18 17:01:26,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 17:01:26,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-18 17:01:26,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:26,978 INFO L225 Difference]: With dead ends: 39456 [2019-12-18 17:01:26,979 INFO L226 Difference]: Without dead ends: 39456 [2019-12-18 17:01:26,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2019-12-18 17:01:27,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39456 states. [2019-12-18 17:01:27,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39456 to 21437. [2019-12-18 17:01:27,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21437 states. [2019-12-18 17:01:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21437 states to 21437 states and 64195 transitions. [2019-12-18 17:01:27,450 INFO L78 Accepts]: Start accepts. Automaton has 21437 states and 64195 transitions. Word has length 34 [2019-12-18 17:01:27,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:27,451 INFO L462 AbstractCegarLoop]: Abstraction has 21437 states and 64195 transitions. [2019-12-18 17:01:27,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:01:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 21437 states and 64195 transitions. [2019-12-18 17:01:27,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 17:01:27,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:27,473 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] [2019-12-18 17:01:27,473 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-18 17:01:27,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:27,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1281586677, now seen corresponding path program 2 times [2019-12-18 17:01:27,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:27,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368454177] [2019-12-18 17:01:27,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:27,591 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-18 17:01:27,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368454177] [2019-12-18 17:01:27,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:27,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:01:27,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317081969] [2019-12-18 17:01:27,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:01:27,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:27,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:01:27,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:01:27,593 INFO L87 Difference]: Start difference. First operand 21437 states and 64195 transitions. Second operand 7 states. [2019-12-18 17:01:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:28,964 INFO L93 Difference]: Finished difference Result 35917 states and 105493 transitions. [2019-12-18 17:01:28,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 17:01:28,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 17:01:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:29,054 INFO L225 Difference]: With dead ends: 35917 [2019-12-18 17:01:29,055 INFO L226 Difference]: Without dead ends: 35917 [2019-12-18 17:01:29,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 17:01:29,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35917 states. [2019-12-18 17:01:30,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35917 to 20324. [2019-12-18 17:01:30,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20324 states. [2019-12-18 17:01:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20324 states to 20324 states and 60908 transitions. [2019-12-18 17:01:30,190 INFO L78 Accepts]: Start accepts. Automaton has 20324 states and 60908 transitions. Word has length 34 [2019-12-18 17:01:30,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:30,191 INFO L462 AbstractCegarLoop]: Abstraction has 20324 states and 60908 transitions. [2019-12-18 17:01:30,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:01:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 20324 states and 60908 transitions. [2019-12-18 17:01:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 17:01:30,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:30,221 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] [2019-12-18 17:01:30,221 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-18 17:01:30,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:30,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1244987983, now seen corresponding path program 3 times [2019-12-18 17:01:30,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:30,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550891340] [2019-12-18 17:01:30,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:30,387 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-18 17:01:30,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550891340] [2019-12-18 17:01:30,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:30,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:01:30,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468911044] [2019-12-18 17:01:30,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:01:30,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:30,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:01:30,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:01:30,389 INFO L87 Difference]: Start difference. First operand 20324 states and 60908 transitions. Second operand 7 states. [2019-12-18 17:01:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:31,589 INFO L93 Difference]: Finished difference Result 46732 states and 135699 transitions. [2019-12-18 17:01:31,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 17:01:31,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 17:01:31,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:31,666 INFO L225 Difference]: With dead ends: 46732 [2019-12-18 17:01:31,666 INFO L226 Difference]: Without dead ends: 46732 [2019-12-18 17:01:31,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:01:31,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46732 states. [2019-12-18 17:01:32,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46732 to 19737. [2019-12-18 17:01:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19737 states. [2019-12-18 17:01:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19737 states to 19737 states and 59173 transitions. [2019-12-18 17:01:32,150 INFO L78 Accepts]: Start accepts. Automaton has 19737 states and 59173 transitions. Word has length 34 [2019-12-18 17:01:32,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:32,151 INFO L462 AbstractCegarLoop]: Abstraction has 19737 states and 59173 transitions. [2019-12-18 17:01:32,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:01:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand 19737 states and 59173 transitions. [2019-12-18 17:01:32,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 17:01:32,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:32,168 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] [2019-12-18 17:01:32,169 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-18 17:01:32,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:32,169 INFO L82 PathProgramCache]: Analyzing trace with hash -851207469, now seen corresponding path program 4 times [2019-12-18 17:01:32,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:32,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066513664] [2019-12-18 17:01:32,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:32,349 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-18 17:01:32,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066513664] [2019-12-18 17:01:32,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:32,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:01:32,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966035036] [2019-12-18 17:01:32,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:01:32,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:32,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:01:32,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:01:32,352 INFO L87 Difference]: Start difference. First operand 19737 states and 59173 transitions. Second operand 9 states. [2019-12-18 17:01:34,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:34,414 INFO L93 Difference]: Finished difference Result 41366 states and 121149 transitions. [2019-12-18 17:01:34,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 17:01:34,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-18 17:01:34,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:34,467 INFO L225 Difference]: With dead ends: 41366 [2019-12-18 17:01:34,467 INFO L226 Difference]: Without dead ends: 41366 [2019-12-18 17:01:34,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-12-18 17:01:34,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41366 states. [2019-12-18 17:01:34,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41366 to 19413. [2019-12-18 17:01:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19413 states. [2019-12-18 17:01:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19413 states to 19413 states and 58228 transitions. [2019-12-18 17:01:34,878 INFO L78 Accepts]: Start accepts. Automaton has 19413 states and 58228 transitions. Word has length 34 [2019-12-18 17:01:34,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:34,878 INFO L462 AbstractCegarLoop]: Abstraction has 19413 states and 58228 transitions. [2019-12-18 17:01:34,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:01:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 19413 states and 58228 transitions. [2019-12-18 17:01:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:01:34,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:34,902 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-18 17:01:34,903 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-18 17:01:34,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:34,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1420266152, now seen corresponding path program 1 times [2019-12-18 17:01:34,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:34,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186815815] [2019-12-18 17:01:34,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:34,962 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-18 17:01:34,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186815815] [2019-12-18 17:01:34,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:34,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:01:34,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178513779] [2019-12-18 17:01:34,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:01:34,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:34,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:01:34,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:34,965 INFO L87 Difference]: Start difference. First operand 19413 states and 58228 transitions. Second operand 3 states. [2019-12-18 17:01:35,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:35,044 INFO L93 Difference]: Finished difference Result 19412 states and 58226 transitions. [2019-12-18 17:01:35,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:01:35,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 17:01:35,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:35,079 INFO L225 Difference]: With dead ends: 19412 [2019-12-18 17:01:35,079 INFO L226 Difference]: Without dead ends: 19412 [2019-12-18 17:01:35,080 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-18 17:01:35,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19412 states. [2019-12-18 17:01:35,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19412 to 19412. [2019-12-18 17:01:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19412 states. [2019-12-18 17:01:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19412 states to 19412 states and 58226 transitions. [2019-12-18 17:01:35,408 INFO L78 Accepts]: Start accepts. Automaton has 19412 states and 58226 transitions. Word has length 39 [2019-12-18 17:01:35,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:35,408 INFO L462 AbstractCegarLoop]: Abstraction has 19412 states and 58226 transitions. [2019-12-18 17:01:35,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:01:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 19412 states and 58226 transitions. [2019-12-18 17:01:35,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:01:35,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:35,428 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] [2019-12-18 17:01:35,428 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-18 17:01:35,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:35,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1015126435, now seen corresponding path program 1 times [2019-12-18 17:01:35,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:35,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085934491] [2019-12-18 17:01:35,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:35,468 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-18 17:01:35,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085934491] [2019-12-18 17:01:35,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:35,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:01:35,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642985138] [2019-12-18 17:01:35,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:01:35,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:35,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:01:35,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:35,470 INFO L87 Difference]: Start difference. First operand 19412 states and 58226 transitions. Second operand 3 states. [2019-12-18 17:01:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:35,598 INFO L93 Difference]: Finished difference Result 36821 states and 110495 transitions. [2019-12-18 17:01:35,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:01:35,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 17:01:35,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:35,626 INFO L225 Difference]: With dead ends: 36821 [2019-12-18 17:01:35,626 INFO L226 Difference]: Without dead ends: 19829 [2019-12-18 17:01:35,627 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-18 17:01:35,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19829 states. [2019-12-18 17:01:35,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19829 to 19763. [2019-12-18 17:01:35,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19763 states. [2019-12-18 17:01:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19763 states to 19763 states and 57956 transitions. [2019-12-18 17:01:35,919 INFO L78 Accepts]: Start accepts. Automaton has 19763 states and 57956 transitions. Word has length 40 [2019-12-18 17:01:35,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:35,919 INFO L462 AbstractCegarLoop]: Abstraction has 19763 states and 57956 transitions. [2019-12-18 17:01:35,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:01:35,919 INFO L276 IsEmpty]: Start isEmpty. Operand 19763 states and 57956 transitions. [2019-12-18 17:01:35,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:01:35,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:35,938 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] [2019-12-18 17:01:35,939 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-18 17:01:35,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:35,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1234885869, now seen corresponding path program 2 times [2019-12-18 17:01:35,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:35,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641859599] [2019-12-18 17:01:35,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:36,008 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-18 17:01:36,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641859599] [2019-12-18 17:01:36,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:36,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:01:36,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080178326] [2019-12-18 17:01:36,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:01:36,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:36,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:01:36,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:01:36,010 INFO L87 Difference]: Start difference. First operand 19763 states and 57956 transitions. Second operand 5 states. [2019-12-18 17:01:37,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:37,024 INFO L93 Difference]: Finished difference Result 28152 states and 81728 transitions. [2019-12-18 17:01:37,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:01:37,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 17:01:37,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:37,080 INFO L225 Difference]: With dead ends: 28152 [2019-12-18 17:01:37,081 INFO L226 Difference]: Without dead ends: 28152 [2019-12-18 17:01:37,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:01:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28152 states. [2019-12-18 17:01:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28152 to 25718. [2019-12-18 17:01:37,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25718 states. [2019-12-18 17:01:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25718 states to 25718 states and 75196 transitions. [2019-12-18 17:01:37,515 INFO L78 Accepts]: Start accepts. Automaton has 25718 states and 75196 transitions. Word has length 40 [2019-12-18 17:01:37,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:37,516 INFO L462 AbstractCegarLoop]: Abstraction has 25718 states and 75196 transitions. [2019-12-18 17:01:37,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:01:37,516 INFO L276 IsEmpty]: Start isEmpty. Operand 25718 states and 75196 transitions. [2019-12-18 17:01:37,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:01:37,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:37,542 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] [2019-12-18 17:01:37,543 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-18 17:01:37,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:37,543 INFO L82 PathProgramCache]: Analyzing trace with hash 342200019, now seen corresponding path program 3 times [2019-12-18 17:01:37,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:37,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897579033] [2019-12-18 17:01:37,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:37,610 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-18 17:01:37,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897579033] [2019-12-18 17:01:37,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:37,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:01:37,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776444080] [2019-12-18 17:01:37,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:01:37,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:37,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:01:37,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:37,612 INFO L87 Difference]: Start difference. First operand 25718 states and 75196 transitions. Second operand 3 states. [2019-12-18 17:01:37,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:37,692 INFO L93 Difference]: Finished difference Result 24330 states and 70130 transitions. [2019-12-18 17:01:37,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:01:37,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 17:01:37,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:37,725 INFO L225 Difference]: With dead ends: 24330 [2019-12-18 17:01:37,725 INFO L226 Difference]: Without dead ends: 24330 [2019-12-18 17:01:37,725 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-18 17:01:37,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24330 states. [2019-12-18 17:01:38,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24330 to 24266. [2019-12-18 17:01:38,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24266 states. [2019-12-18 17:01:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24266 states to 24266 states and 69952 transitions. [2019-12-18 17:01:38,060 INFO L78 Accepts]: Start accepts. Automaton has 24266 states and 69952 transitions. Word has length 40 [2019-12-18 17:01:38,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:38,060 INFO L462 AbstractCegarLoop]: Abstraction has 24266 states and 69952 transitions. [2019-12-18 17:01:38,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:01:38,060 INFO L276 IsEmpty]: Start isEmpty. Operand 24266 states and 69952 transitions. [2019-12-18 17:01:38,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 17:01:38,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:38,081 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] [2019-12-18 17:01:38,081 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-18 17:01:38,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:38,082 INFO L82 PathProgramCache]: Analyzing trace with hash -2044650148, now seen corresponding path program 1 times [2019-12-18 17:01:38,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:38,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775140467] [2019-12-18 17:01:38,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:38,149 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-18 17:01:38,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775140467] [2019-12-18 17:01:38,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:38,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:01:38,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586919193] [2019-12-18 17:01:38,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:01:38,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:38,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:01:38,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:38,151 INFO L87 Difference]: Start difference. First operand 24266 states and 69952 transitions. Second operand 3 states. [2019-12-18 17:01:38,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:38,260 INFO L93 Difference]: Finished difference Result 24266 states and 69874 transitions. [2019-12-18 17:01:38,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:01:38,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 17:01:38,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:38,312 INFO L225 Difference]: With dead ends: 24266 [2019-12-18 17:01:38,312 INFO L226 Difference]: Without dead ends: 24266 [2019-12-18 17:01:38,312 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-18 17:01:38,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24266 states. [2019-12-18 17:01:38,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24266 to 19817. [2019-12-18 17:01:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19817 states. [2019-12-18 17:01:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19817 states to 19817 states and 57519 transitions. [2019-12-18 17:01:38,815 INFO L78 Accepts]: Start accepts. Automaton has 19817 states and 57519 transitions. Word has length 41 [2019-12-18 17:01:38,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:38,816 INFO L462 AbstractCegarLoop]: Abstraction has 19817 states and 57519 transitions. [2019-12-18 17:01:38,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:01:38,816 INFO L276 IsEmpty]: Start isEmpty. Operand 19817 states and 57519 transitions. [2019-12-18 17:01:38,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 17:01:38,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:38,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:38,843 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-18 17:01:38,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:38,843 INFO L82 PathProgramCache]: Analyzing trace with hash 884175412, now seen corresponding path program 1 times [2019-12-18 17:01:38,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:38,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913236204] [2019-12-18 17:01:38,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:38,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913236204] [2019-12-18 17:01:38,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:38,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:01:38,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290659874] [2019-12-18 17:01:38,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:01:38,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:38,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:01:38,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:01:38,897 INFO L87 Difference]: Start difference. First operand 19817 states and 57519 transitions. Second operand 5 states. [2019-12-18 17:01:39,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:39,007 INFO L93 Difference]: Finished difference Result 18568 states and 54840 transitions. [2019-12-18 17:01:39,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:01:39,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 17:01:39,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:39,047 INFO L225 Difference]: With dead ends: 18568 [2019-12-18 17:01:39,047 INFO L226 Difference]: Without dead ends: 17139 [2019-12-18 17:01:39,054 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-18 17:01:39,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17139 states. [2019-12-18 17:01:39,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17139 to 17139. [2019-12-18 17:01:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17139 states. [2019-12-18 17:01:39,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17139 states to 17139 states and 51794 transitions. [2019-12-18 17:01:39,943 INFO L78 Accepts]: Start accepts. Automaton has 17139 states and 51794 transitions. Word has length 42 [2019-12-18 17:01:39,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:39,943 INFO L462 AbstractCegarLoop]: Abstraction has 17139 states and 51794 transitions. [2019-12-18 17:01:39,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:01:39,944 INFO L276 IsEmpty]: Start isEmpty. Operand 17139 states and 51794 transitions. [2019-12-18 17:01:39,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:01:39,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:39,980 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-18 17:01:39,981 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-18 17:01:39,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:39,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1215626616, now seen corresponding path program 1 times [2019-12-18 17:01:39,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:39,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885391349] [2019-12-18 17:01:39,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:40,097 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-18 17:01:40,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885391349] [2019-12-18 17:01:40,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:40,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:01:40,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222693914] [2019-12-18 17:01:40,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:01:40,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:40,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:01:40,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:01:40,105 INFO L87 Difference]: Start difference. First operand 17139 states and 51794 transitions. Second operand 7 states. [2019-12-18 17:01:40,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:40,789 INFO L93 Difference]: Finished difference Result 48114 states and 143833 transitions. [2019-12-18 17:01:40,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:01:40,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 17:01:40,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:40,866 INFO L225 Difference]: With dead ends: 48114 [2019-12-18 17:01:40,866 INFO L226 Difference]: Without dead ends: 33834 [2019-12-18 17:01:40,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:01:41,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33834 states. [2019-12-18 17:01:41,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33834 to 20005. [2019-12-18 17:01:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20005 states. [2019-12-18 17:01:41,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20005 states to 20005 states and 59874 transitions. [2019-12-18 17:01:41,384 INFO L78 Accepts]: Start accepts. Automaton has 20005 states and 59874 transitions. Word has length 66 [2019-12-18 17:01:41,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:41,384 INFO L462 AbstractCegarLoop]: Abstraction has 20005 states and 59874 transitions. [2019-12-18 17:01:41,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:01:41,384 INFO L276 IsEmpty]: Start isEmpty. Operand 20005 states and 59874 transitions. [2019-12-18 17:01:41,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:01:41,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:41,402 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-18 17:01:41,402 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-18 17:01:41,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:41,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1961322332, now seen corresponding path program 2 times [2019-12-18 17:01:41,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:41,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119562874] [2019-12-18 17:01:41,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:41,720 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-18 17:01:41,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119562874] [2019-12-18 17:01:41,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:41,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:01:41,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135705564] [2019-12-18 17:01:41,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:01:41,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:41,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:01:41,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:01:41,722 INFO L87 Difference]: Start difference. First operand 20005 states and 59874 transitions. Second operand 11 states. [2019-12-18 17:01:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:46,803 INFO L93 Difference]: Finished difference Result 42351 states and 125500 transitions. [2019-12-18 17:01:46,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 17:01:46,803 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 17:01:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:46,856 INFO L225 Difference]: With dead ends: 42351 [2019-12-18 17:01:46,856 INFO L226 Difference]: Without dead ends: 42135 [2019-12-18 17:01:46,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=382, Invalid=1424, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 17:01:46,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42135 states. [2019-12-18 17:01:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42135 to 20964. [2019-12-18 17:01:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20964 states. [2019-12-18 17:01:47,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20964 states to 20964 states and 62942 transitions. [2019-12-18 17:01:47,302 INFO L78 Accepts]: Start accepts. Automaton has 20964 states and 62942 transitions. Word has length 66 [2019-12-18 17:01:47,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:47,302 INFO L462 AbstractCegarLoop]: Abstraction has 20964 states and 62942 transitions. [2019-12-18 17:01:47,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:01:47,302 INFO L276 IsEmpty]: Start isEmpty. Operand 20964 states and 62942 transitions. [2019-12-18 17:01:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:01:47,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:47,324 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-18 17:01:47,325 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-18 17:01:47,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:47,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1828255542, now seen corresponding path program 3 times [2019-12-18 17:01:47,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:47,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848612318] [2019-12-18 17:01:47,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:47,435 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-18 17:01:47,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848612318] [2019-12-18 17:01:47,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:47,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:01:47,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075942265] [2019-12-18 17:01:47,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:01:47,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:47,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:01:47,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:01:47,438 INFO L87 Difference]: Start difference. First operand 20964 states and 62942 transitions. Second operand 9 states. [2019-12-18 17:01:51,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:51,098 INFO L93 Difference]: Finished difference Result 48667 states and 143462 transitions. [2019-12-18 17:01:51,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 17:01:51,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 17:01:51,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:51,159 INFO L225 Difference]: With dead ends: 48667 [2019-12-18 17:01:51,160 INFO L226 Difference]: Without dead ends: 48539 [2019-12-18 17:01:51,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=466, Invalid=1984, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 17:01:51,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48539 states. [2019-12-18 17:01:52,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48539 to 20769. [2019-12-18 17:01:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20769 states. [2019-12-18 17:01:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20769 states to 20769 states and 62252 transitions. [2019-12-18 17:01:52,204 INFO L78 Accepts]: Start accepts. Automaton has 20769 states and 62252 transitions. Word has length 66 [2019-12-18 17:01:52,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:52,204 INFO L462 AbstractCegarLoop]: Abstraction has 20769 states and 62252 transitions. [2019-12-18 17:01:52,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:01:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 20769 states and 62252 transitions. [2019-12-18 17:01:52,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:01:52,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:52,227 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-18 17:01:52,227 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-18 17:01:52,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:52,227 INFO L82 PathProgramCache]: Analyzing trace with hash -178270044, now seen corresponding path program 4 times [2019-12-18 17:01:52,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:52,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383461926] [2019-12-18 17:01:52,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:52,311 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-18 17:01:52,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383461926] [2019-12-18 17:01:52,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:52,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:01:52,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61204299] [2019-12-18 17:01:52,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:01:52,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:52,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:01:52,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:01:52,314 INFO L87 Difference]: Start difference. First operand 20769 states and 62252 transitions. Second operand 8 states. [2019-12-18 17:01:53,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:53,468 INFO L93 Difference]: Finished difference Result 40034 states and 119878 transitions. [2019-12-18 17:01:53,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:01:53,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 17:01:53,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:53,515 INFO L225 Difference]: With dead ends: 40034 [2019-12-18 17:01:53,515 INFO L226 Difference]: Without dead ends: 32335 [2019-12-18 17:01:53,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:01:53,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32335 states. [2019-12-18 17:01:53,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32335 to 21470. [2019-12-18 17:01:53,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21470 states. [2019-12-18 17:01:53,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21470 states to 21470 states and 63912 transitions. [2019-12-18 17:01:53,910 INFO L78 Accepts]: Start accepts. Automaton has 21470 states and 63912 transitions. Word has length 66 [2019-12-18 17:01:53,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:53,910 INFO L462 AbstractCegarLoop]: Abstraction has 21470 states and 63912 transitions. [2019-12-18 17:01:53,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:01:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand 21470 states and 63912 transitions. [2019-12-18 17:01:53,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:01:53,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:53,931 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-18 17:01:53,931 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:53,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:53,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1109171142, now seen corresponding path program 5 times [2019-12-18 17:01:53,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:53,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681095882] [2019-12-18 17:01:53,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:54,027 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-18 17:01:54,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681095882] [2019-12-18 17:01:54,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:54,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:01:54,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836065781] [2019-12-18 17:01:54,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:01:54,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:54,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:01:54,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:01:54,029 INFO L87 Difference]: Start difference. First operand 21470 states and 63912 transitions. Second operand 9 states. [2019-12-18 17:01:55,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:55,365 INFO L93 Difference]: Finished difference Result 37534 states and 111576 transitions. [2019-12-18 17:01:55,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:01:55,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 17:01:55,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:55,410 INFO L225 Difference]: With dead ends: 37534 [2019-12-18 17:01:55,410 INFO L226 Difference]: Without dead ends: 31687 [2019-12-18 17:01:55,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:01:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31687 states. [2019-12-18 17:01:55,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31687 to 21254. [2019-12-18 17:01:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21254 states. [2019-12-18 17:01:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21254 states to 21254 states and 63224 transitions. [2019-12-18 17:01:55,814 INFO L78 Accepts]: Start accepts. Automaton has 21254 states and 63224 transitions. Word has length 66 [2019-12-18 17:01:55,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:55,815 INFO L462 AbstractCegarLoop]: Abstraction has 21254 states and 63224 transitions. [2019-12-18 17:01:55,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:01:55,815 INFO L276 IsEmpty]: Start isEmpty. Operand 21254 states and 63224 transitions. [2019-12-18 17:01:55,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:01:55,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:55,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:55,837 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:55,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:55,838 INFO L82 PathProgramCache]: Analyzing trace with hash 191706936, now seen corresponding path program 6 times [2019-12-18 17:01:55,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:55,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068165737] [2019-12-18 17:01:55,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:56,669 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-18 17:01:56,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068165737] [2019-12-18 17:01:56,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:56,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:01:56,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707728012] [2019-12-18 17:01:56,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:01:56,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:56,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:01:56,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:01:56,672 INFO L87 Difference]: Start difference. First operand 21254 states and 63224 transitions. Second operand 11 states. [2019-12-18 17:01:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:58,034 INFO L93 Difference]: Finished difference Result 43182 states and 128881 transitions. [2019-12-18 17:01:58,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 17:01:58,035 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 17:01:58,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:58,090 INFO L225 Difference]: With dead ends: 43182 [2019-12-18 17:01:58,090 INFO L226 Difference]: Without dead ends: 40730 [2019-12-18 17:01:58,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 17:01:58,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40730 states. [2019-12-18 17:01:58,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40730 to 23977. [2019-12-18 17:01:58,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23977 states. [2019-12-18 17:01:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23977 states to 23977 states and 70744 transitions. [2019-12-18 17:01:58,567 INFO L78 Accepts]: Start accepts. Automaton has 23977 states and 70744 transitions. Word has length 66 [2019-12-18 17:01:58,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:58,567 INFO L462 AbstractCegarLoop]: Abstraction has 23977 states and 70744 transitions. [2019-12-18 17:01:58,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:01:58,567 INFO L276 IsEmpty]: Start isEmpty. Operand 23977 states and 70744 transitions. [2019-12-18 17:01:58,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:01:58,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:58,593 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-18 17:01:58,593 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:58,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:58,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2025639272, now seen corresponding path program 7 times [2019-12-18 17:01:58,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:58,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683841932] [2019-12-18 17:01:58,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:58,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683841932] [2019-12-18 17:01:58,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:58,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:01:58,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977269042] [2019-12-18 17:01:58,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:01:58,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:58,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:01:58,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:01:58,876 INFO L87 Difference]: Start difference. First operand 23977 states and 70744 transitions. Second operand 11 states. [2019-12-18 17:01:59,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:59,933 INFO L93 Difference]: Finished difference Result 41279 states and 121825 transitions. [2019-12-18 17:01:59,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 17:01:59,934 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 17:01:59,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:59,980 INFO L225 Difference]: With dead ends: 41279 [2019-12-18 17:01:59,981 INFO L226 Difference]: Without dead ends: 34971 [2019-12-18 17:01:59,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:02:00,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34971 states. [2019-12-18 17:02:00,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34971 to 20516. [2019-12-18 17:02:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20516 states. [2019-12-18 17:02:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20516 states to 20516 states and 61037 transitions. [2019-12-18 17:02:00,377 INFO L78 Accepts]: Start accepts. Automaton has 20516 states and 61037 transitions. Word has length 66 [2019-12-18 17:02:00,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:00,377 INFO L462 AbstractCegarLoop]: Abstraction has 20516 states and 61037 transitions. [2019-12-18 17:02:00,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:02:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 20516 states and 61037 transitions. [2019-12-18 17:02:00,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:02:00,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:00,396 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-18 17:02:00,396 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:00,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:00,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1594558236, now seen corresponding path program 8 times [2019-12-18 17:02:00,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:00,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494847247] [2019-12-18 17:02:00,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:00,501 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-18 17:02:00,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494847247] [2019-12-18 17:02:00,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:00,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:02:00,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541502370] [2019-12-18 17:02:00,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:02:00,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:00,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:02:00,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:02:00,503 INFO L87 Difference]: Start difference. First operand 20516 states and 61037 transitions. Second operand 4 states. [2019-12-18 17:02:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:01,082 INFO L93 Difference]: Finished difference Result 23201 states and 69208 transitions. [2019-12-18 17:02:01,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:02:01,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 17:02:01,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:01,133 INFO L225 Difference]: With dead ends: 23201 [2019-12-18 17:02:01,133 INFO L226 Difference]: Without dead ends: 23201 [2019-12-18 17:02:01,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:02:01,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23201 states. [2019-12-18 17:02:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23201 to 19440. [2019-12-18 17:02:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19440 states. [2019-12-18 17:02:01,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19440 states to 19440 states and 58099 transitions. [2019-12-18 17:02:01,624 INFO L78 Accepts]: Start accepts. Automaton has 19440 states and 58099 transitions. Word has length 66 [2019-12-18 17:02:01,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:01,624 INFO L462 AbstractCegarLoop]: Abstraction has 19440 states and 58099 transitions. [2019-12-18 17:02:01,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:02:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 19440 states and 58099 transitions. [2019-12-18 17:02:01,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:02:01,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:01,659 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-18 17:02:01,660 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:01,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:01,660 INFO L82 PathProgramCache]: Analyzing trace with hash 765672949, now seen corresponding path program 1 times [2019-12-18 17:02:01,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:01,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189052497] [2019-12-18 17:02:01,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:01,961 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-18 17:02:01,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189052497] [2019-12-18 17:02:01,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:01,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:02:01,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145031152] [2019-12-18 17:02:01,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:02:01,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:01,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:02:01,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:02:01,962 INFO L87 Difference]: Start difference. First operand 19440 states and 58099 transitions. Second operand 11 states. [2019-12-18 17:02:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:02,979 INFO L93 Difference]: Finished difference Result 34582 states and 103705 transitions. [2019-12-18 17:02:02,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 17:02:02,985 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 17:02:02,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:03,031 INFO L225 Difference]: With dead ends: 34582 [2019-12-18 17:02:03,031 INFO L226 Difference]: Without dead ends: 34157 [2019-12-18 17:02:03,031 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-18 17:02:03,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34157 states. [2019-12-18 17:02:03,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34157 to 19186. [2019-12-18 17:02:03,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19186 states. [2019-12-18 17:02:03,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19186 states to 19186 states and 57455 transitions. [2019-12-18 17:02:03,424 INFO L78 Accepts]: Start accepts. Automaton has 19186 states and 57455 transitions. Word has length 67 [2019-12-18 17:02:03,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:03,425 INFO L462 AbstractCegarLoop]: Abstraction has 19186 states and 57455 transitions. [2019-12-18 17:02:03,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:02:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand 19186 states and 57455 transitions. [2019-12-18 17:02:03,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:02:03,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:03,442 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-18 17:02:03,442 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:03,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:03,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1127178005, now seen corresponding path program 2 times [2019-12-18 17:02:03,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:03,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245025252] [2019-12-18 17:02:03,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:02:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:02:03,575 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:02:03,575 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:02:03,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= 0 v_~z$r_buff1_thd3~0_333) (= 0 v_~__unbuffered_cnt~0_79) (= v_~z~0_222 0) (= 0 v_~x~0_150) (= 0 v_~z$flush_delayed~0_66) (= v_~__unbuffered_p2_EBX~0_70 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t745~0.base_43| 1) |v_#valid_80|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t745~0.base_43|) (= v_~y~0_71 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$r_buff0_thd1~0_186 0) (= v_~z$w_buff1_used~0_670 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t745~0.base_43| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t745~0.base_43|) |v_ULTIMATE.start_main_~#t745~0.offset_29| 0)) |v_#memory_int_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t745~0.base_43|) 0) (= v_~z$r_buff0_thd2~0_110 0) (= 0 v_~weak$$choice0~0_29) (= v_~z$w_buff0~0_701 0) (= v_~z$r_buff1_thd0~0_201 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff0_thd3~0_363) (= 0 v_~__unbuffered_p2_EAX~0_62) (= |v_#NULL.offset_5| 0) (= v_~z$mem_tmp~0_43 0) (= v_~z$r_buff0_thd0~0_137 0) (= v_~weak$$choice2~0_160 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t745~0.base_43| 4)) (= 0 |v_ULTIMATE.start_main_~#t745~0.offset_29|) (= v_~z$r_buff1_thd1~0_144 0) (= v_~z$r_buff1_thd2~0_165 0) (= v_~z$w_buff0_used~0_1072 0) (= v_~z$w_buff1~0_410 0) (= v_~main$tmp_guard0~0_24 0) (= v_~main$tmp_guard1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_46|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_202|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_120|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ULTIMATE.start_main_~#t745~0.base=|v_ULTIMATE.start_main_~#t745~0.base_43|, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~z$mem_tmp~0=v_~z$mem_tmp~0_43, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ULTIMATE.start_main_~#t747~0.base=|v_ULTIMATE.start_main_~#t747~0.base_29|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_670, ULTIMATE.start_main_~#t746~0.offset=|v_ULTIMATE.start_main_~#t746~0.offset_22|, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_144, ULTIMATE.start_main_~#t747~0.offset=|v_ULTIMATE.start_main_~#t747~0.offset_21|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_363, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~x~0=v_~x~0_150, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_410, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_74|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t746~0.base=|v_ULTIMATE.start_main_~#t746~0.base_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_34|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_201, ~y~0=v_~y~0_71, ULTIMATE.start_main_~#t745~0.offset=|v_ULTIMATE.start_main_~#t745~0.offset_29|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_110, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_26|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1072, ~z$w_buff0~0=v_~z$w_buff0~0_701, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_333, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_80|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_222, ~weak$$choice2~0=v_~weak$$choice2~0_160, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_186} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t746~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t745~0.base, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t745~0.offset, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~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, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t747~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t746~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, ULTIMATE.start_main_~#t747~0.offset, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 17:02:03,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L823-1-->L825: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t746~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t746~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t746~0.base_11|) |v_ULTIMATE.start_main_~#t746~0.offset_10| 1)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t746~0.offset_10| 0) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t746~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t746~0.base_11| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t746~0.base_11|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t746~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t746~0.offset=|v_ULTIMATE.start_main_~#t746~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t746~0.base=|v_ULTIMATE.start_main_~#t746~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t746~0.offset, #length, ULTIMATE.start_main_~#t746~0.base] because there is no mapped edge [2019-12-18 17:02:03,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_23 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|) (= v_~z$w_buff0_used~0_174 1) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= v_~z$w_buff0~0_53 v_~z$w_buff1~0_38) (= v_~z$w_buff0_used~0_175 v_~z$w_buff1_used~0_104) (= (mod v_~z$w_buff1_used~0_104 256) 0) (= 1 v_~z$w_buff0~0_52)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~z$w_buff0~0=v_~z$w_buff0~0_53, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_174, ~z$w_buff0~0=v_~z$w_buff0~0_52, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_104, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~z$w_buff1~0=v_~z$w_buff1~0_38, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 17:02:03,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L825-1-->L827: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t747~0.base_10| 4) |v_#length_15|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t747~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t747~0.base_10|) |v_ULTIMATE.start_main_~#t747~0.offset_9| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t747~0.base_10|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t747~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t747~0.base_10| 0)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t747~0.base_10|) 0) (= 0 |v_ULTIMATE.start_main_~#t747~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t747~0.base=|v_ULTIMATE.start_main_~#t747~0.base_10|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t747~0.offset=|v_ULTIMATE.start_main_~#t747~0.offset_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t747~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t747~0.offset, #length] because there is no mapped edge [2019-12-18 17:02:03,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L764-2-->L764-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1695750034 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In1695750034 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In1695750034 |P1Thread1of1ForFork1_#t~ite9_Out1695750034|) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In1695750034 |P1Thread1of1ForFork1_#t~ite9_Out1695750034|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1695750034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1695750034, ~z$w_buff1~0=~z$w_buff1~0_In1695750034, ~z~0=~z~0_In1695750034} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1695750034|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1695750034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1695750034, ~z$w_buff1~0=~z$w_buff1~0_In1695750034, ~z~0=~z~0_In1695750034} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 17:02:03,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In809597669 256)))) (or (and (= ~z$w_buff0~0_In809597669 |P2Thread1of1ForFork2_#t~ite21_Out809597669|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite20_In809597669| |P2Thread1of1ForFork2_#t~ite20_Out809597669|)) (and (= ~z$w_buff0~0_In809597669 |P2Thread1of1ForFork2_#t~ite20_Out809597669|) .cse0 (= |P2Thread1of1ForFork2_#t~ite21_Out809597669| |P2Thread1of1ForFork2_#t~ite20_Out809597669|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In809597669 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In809597669 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In809597669 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In809597669 256) 0))))))) InVars {~z$w_buff0~0=~z$w_buff0~0_In809597669, ~z$w_buff0_used~0=~z$w_buff0_used~0_In809597669, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In809597669|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In809597669, ~z$w_buff1_used~0=~z$w_buff1_used~0_In809597669, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In809597669, ~weak$$choice2~0=~weak$$choice2~0_In809597669} OutVars{~z$w_buff0~0=~z$w_buff0~0_In809597669, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out809597669|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In809597669, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out809597669|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In809597669, ~z$w_buff1_used~0=~z$w_buff1_used~0_In809597669, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In809597669, ~weak$$choice2~0=~weak$$choice2~0_In809597669} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 17:02:03,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1228899801 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1228899801 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1228899801|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1228899801 |P0Thread1of1ForFork0_#t~ite5_Out-1228899801|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1228899801, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1228899801} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1228899801|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1228899801, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1228899801} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 17:02:03,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L746-->L746-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1718241089 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1718241089 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1718241089 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1718241089 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1718241089| ~z$w_buff1_used~0_In-1718241089)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1718241089| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1718241089, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1718241089, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1718241089, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1718241089} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1718241089|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1718241089, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1718241089, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1718241089, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1718241089} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 17:02:03,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-63676668 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-63676668 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-63676668) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In-63676668 ~z$r_buff0_thd1~0_Out-63676668) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-63676668, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-63676668} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-63676668, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-63676668|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-63676668} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:02:03,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In1718619258 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1718619258 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1718619258 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In1718619258 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1718619258|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd1~0_In1718619258 |P0Thread1of1ForFork0_#t~ite8_Out1718619258|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1718619258, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1718619258, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1718619258, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1718619258} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1718619258, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1718619258|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1718619258, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1718619258, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1718619258} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 17:02:03,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L748-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_62 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_62, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 17:02:03,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L790-->L790-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1401527786 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite24_Out1401527786| ~z$w_buff1~0_In1401527786) (= |P2Thread1of1ForFork2_#t~ite23_In1401527786| |P2Thread1of1ForFork2_#t~ite23_Out1401527786|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1401527786 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In1401527786 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1401527786 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1401527786 256)))) (= ~z$w_buff1~0_In1401527786 |P2Thread1of1ForFork2_#t~ite23_Out1401527786|) (= |P2Thread1of1ForFork2_#t~ite24_Out1401527786| |P2Thread1of1ForFork2_#t~ite23_Out1401527786|) .cse0))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In1401527786|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1401527786, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1401527786, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1401527786, ~z$w_buff1~0=~z$w_buff1~0_In1401527786, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1401527786, ~weak$$choice2~0=~weak$$choice2~0_In1401527786} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out1401527786|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out1401527786|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1401527786, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1401527786, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1401527786, ~z$w_buff1~0=~z$w_buff1~0_In1401527786, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1401527786, ~weak$$choice2~0=~weak$$choice2~0_In1401527786} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 17:02:03,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L791-->L791-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1497367153 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1497367153 |P2Thread1of1ForFork2_#t~ite26_Out-1497367153|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1497367153 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-1497367153 256) 0) .cse0) (and (= (mod ~z$r_buff1_thd3~0_In-1497367153 256) 0) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-1497367153 256)))) .cse1 (= |P2Thread1of1ForFork2_#t~ite27_Out-1497367153| |P2Thread1of1ForFork2_#t~ite26_Out-1497367153|)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite27_Out-1497367153| ~z$w_buff0_used~0_In-1497367153) (= |P2Thread1of1ForFork2_#t~ite26_In-1497367153| |P2Thread1of1ForFork2_#t~ite26_Out-1497367153|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-1497367153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1497367153, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1497367153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1497367153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1497367153, ~weak$$choice2~0=~weak$$choice2~0_In-1497367153} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-1497367153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1497367153, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1497367153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1497367153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1497367153, ~weak$$choice2~0=~weak$$choice2~0_In-1497367153, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-1497367153|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 17:02:03,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L793-->L794: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~z$r_buff0_thd3~0_119 v_~z$r_buff0_thd3~0_118)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_119, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_8|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 17:02:03,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-4-->L765: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~z~0_16) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 17:02:03,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1461148915 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1461148915 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1461148915| ~z$w_buff0_used~0_In-1461148915)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1461148915|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1461148915, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1461148915} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1461148915, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1461148915|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1461148915} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 17:02:03,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In2110712697 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2110712697 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In2110712697 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In2110712697 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In2110712697 |P1Thread1of1ForFork1_#t~ite12_Out2110712697|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out2110712697|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2110712697, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2110712697, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2110712697, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2110712697} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2110712697, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2110712697, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2110712697, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out2110712697|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2110712697} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 17:02:03,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1421129402 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1421129402 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1421129402|) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-1421129402 |P1Thread1of1ForFork1_#t~ite13_Out-1421129402|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1421129402, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1421129402} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1421129402, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1421129402|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1421129402} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 17:02:03,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L796-->L800: Formula: (and (= v_~z~0_64 v_~z$mem_tmp~0_7) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 17:02:03,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L800-2-->L800-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite39_Out618574438| |P2Thread1of1ForFork2_#t~ite38_Out618574438|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In618574438 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In618574438 256)))) (or (and .cse0 (= ~z$w_buff1~0_In618574438 |P2Thread1of1ForFork2_#t~ite38_Out618574438|) (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~z~0_In618574438 |P2Thread1of1ForFork2_#t~ite38_Out618574438|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In618574438, ~z$w_buff1_used~0=~z$w_buff1_used~0_In618574438, ~z$w_buff1~0=~z$w_buff1~0_In618574438, ~z~0=~z~0_In618574438} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In618574438, ~z$w_buff1_used~0=~z$w_buff1_used~0_In618574438, ~z$w_buff1~0=~z$w_buff1~0_In618574438, ~z~0=~z~0_In618574438, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out618574438|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out618574438|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 17:02:03,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1041698144 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1041698144 256) 0))) (or (and (= ~z$w_buff0_used~0_In1041698144 |P2Thread1of1ForFork2_#t~ite40_Out1041698144|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out1041698144|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1041698144, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1041698144} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1041698144, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1041698144, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1041698144|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 17:02:03,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1301095949 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1301095949 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1301095949 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1301095949 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite41_Out1301095949| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite41_Out1301095949| ~z$w_buff1_used~0_In1301095949)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1301095949, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1301095949, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1301095949, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1301095949} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1301095949|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1301095949, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1301095949, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1301095949, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1301095949} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 17:02:03,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In614618866 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In614618866 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In614618866 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In614618866 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out614618866|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In614618866 |P1Thread1of1ForFork1_#t~ite14_Out614618866|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In614618866, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In614618866, ~z$w_buff1_used~0=~z$w_buff1_used~0_In614618866, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In614618866} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In614618866, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In614618866, ~z$w_buff1_used~0=~z$w_buff1_used~0_In614618866, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out614618866|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In614618866} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 17:02:03,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_70) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_70, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 17:02:03,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-595031217 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-595031217 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out-595031217| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite42_Out-595031217| ~z$r_buff0_thd3~0_In-595031217) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-595031217, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-595031217} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-595031217|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-595031217, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-595031217} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 17:02:03,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In952686961 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In952686961 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In952686961 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In952686961 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out952686961|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In952686961 |P2Thread1of1ForFork2_#t~ite43_Out952686961|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In952686961, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In952686961, ~z$w_buff1_used~0=~z$w_buff1_used~0_In952686961, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In952686961} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In952686961, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In952686961, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out952686961|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In952686961, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In952686961} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 17:02:03,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L804-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= v_~z$r_buff1_thd3~0_119 |v_P2Thread1of1ForFork2_#t~ite43_28|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_119, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_27|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 17:02:03,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L827-1-->L833: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:02:03,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L833-2-->L833-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In642290425 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In642290425 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out642290425| |ULTIMATE.start_main_#t~ite47_Out642290425|))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out642290425| ~z~0_In642290425) (or .cse0 .cse1) .cse2) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out642290425| ~z$w_buff1~0_In642290425) (not .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In642290425, ~z$w_buff1_used~0=~z$w_buff1_used~0_In642290425, ~z$w_buff1~0=~z$w_buff1~0_In642290425, ~z~0=~z~0_In642290425} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In642290425, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out642290425|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In642290425, ~z$w_buff1~0=~z$w_buff1~0_In642290425, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out642290425|, ~z~0=~z~0_In642290425} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 17:02:03,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1489014090 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1489014090 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1489014090 |ULTIMATE.start_main_#t~ite49_Out-1489014090|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1489014090|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1489014090, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1489014090} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1489014090, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1489014090, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1489014090|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 17:02:03,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In764711368 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In764711368 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In764711368 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In764711368 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out764711368| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite50_Out764711368| ~z$w_buff1_used~0_In764711368)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In764711368, ~z$w_buff0_used~0=~z$w_buff0_used~0_In764711368, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In764711368, ~z$w_buff1_used~0=~z$w_buff1_used~0_In764711368} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out764711368|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In764711368, ~z$w_buff0_used~0=~z$w_buff0_used~0_In764711368, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In764711368, ~z$w_buff1_used~0=~z$w_buff1_used~0_In764711368} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 17:02:03,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1392947589 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1392947589 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-1392947589| 0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1392947589 |ULTIMATE.start_main_#t~ite51_Out-1392947589|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1392947589, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1392947589} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1392947589, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1392947589|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1392947589} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 17:02:03,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L837-->L837-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In146397386 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In146397386 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In146397386 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In146397386 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In146397386 |ULTIMATE.start_main_#t~ite52_Out146397386|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite52_Out146397386| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In146397386, ~z$w_buff0_used~0=~z$w_buff0_used~0_In146397386, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In146397386, ~z$w_buff1_used~0=~z$w_buff1_used~0_In146397386} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out146397386|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In146397386, ~z$w_buff0_used~0=~z$w_buff0_used~0_In146397386, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In146397386, ~z$w_buff1_used~0=~z$w_buff1_used~0_In146397386} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 17:02:03,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_37 2) (= 2 v_~__unbuffered_p2_EAX~0_30) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~__unbuffered_p2_EBX~0_37 0) (= 2 v_~x~0_117) (= v_~main$tmp_guard1~0_27 0) (= (mod v_~main$tmp_guard1~0_27 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_162 |v_ULTIMATE.start_main_#t~ite52_69|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_69|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_37, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~y~0=v_~y~0_37, ~x~0=v_~x~0_117} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_162, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~y~0=v_~y~0_37, ~x~0=v_~x~0_117, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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-18 17:02:03,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:02:03 BasicIcfg [2019-12-18 17:02:03,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:02:03,708 INFO L168 Benchmark]: Toolchain (without parser) took 120859.77 ms. Allocated memory was 146.3 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 103.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-18 17:02:03,708 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 17:02:03,709 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.44 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 103.2 MB in the beginning and 155.6 MB in the end (delta: -52.4 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:02:03,709 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.04 ms. Allocated memory is still 203.9 MB. Free memory was 155.6 MB in the beginning and 152.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:02:03,710 INFO L168 Benchmark]: Boogie Preprocessor took 40.37 ms. Allocated memory is still 203.9 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-18 17:02:03,710 INFO L168 Benchmark]: RCFGBuilder took 913.37 ms. Allocated memory is still 203.9 MB. Free memory was 150.8 MB in the beginning and 100.3 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:02:03,710 INFO L168 Benchmark]: TraceAbstraction took 119069.97 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-18 17:02:03,713 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.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 771.44 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 103.2 MB in the beginning and 155.6 MB in the end (delta: -52.4 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.04 ms. Allocated memory is still 203.9 MB. Free memory was 155.6 MB in the beginning and 152.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.37 ms. Allocated memory is still 203.9 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 913.37 ms. Allocated memory is still 203.9 MB. Free memory was 150.8 MB in the beginning and 100.3 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 119069.97 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 175 ProgramPointsBefore, 93 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 6798 VarBasedMoverChecksPositive, 289 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 285 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 87070 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t745, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L744] 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_p2_EAX=0, __unbuffered_p2_EBX=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] [L825] FCALL, FORK 0 pthread_create(&t746, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L827] FCALL, FORK 0 pthread_create(&t747, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 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_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L785] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L786] 3 z$flush_delayed = weak$$choice2 [L787] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, 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_buff1=0, z$w_buff1_used=0] [L788] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, 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_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L788] 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) [L744] 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) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 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 [L789] 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)) [L790] 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)) [L791] 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)) [L792] 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=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=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=2, y=2, z=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L792] 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)) [L794] 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=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=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=2, y=2, z=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L794] 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)) [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, 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=0, 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] [L766] 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 [L800] 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=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, 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] [L800] 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) [L801] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L802] 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 [L803] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, 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] [L833] 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) [L834] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L835] 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 [L836] 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, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 118.7s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 43.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8356 SDtfs, 11531 SDslu, 28476 SDs, 0 SdLazy, 17438 SolverSat, 585 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 466 GetRequests, 55 SyntacticMatches, 32 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2389 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151934occurred 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: 45.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 356069 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1311 NumberOfCodeBlocks, 1311 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1213 ConstructedInterpolants, 0 QuantifiedInterpolants, 349232 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...