/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/podwr001_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:39:12,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:39:12,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:39:12,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:39:12,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:39:12,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:39:12,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:39:12,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:39:12,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:39:12,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:39:12,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:39:12,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:39:12,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:39:12,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:39:12,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:39:12,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:39:12,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:39:12,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:39:12,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:39:12,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:39:12,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:39:12,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:39:12,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:39:12,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:39:12,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:39:12,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:39:12,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:39:12,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:39:12,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:39:12,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:39:12,663 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:39:12,664 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:39:12,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:39:12,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:39:12,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:39:12,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:39:12,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:39:12,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:39:12,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:39:12,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:39:12,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:39:12,674 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:39:12,703 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:39:12,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:39:12,705 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:39:12,705 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:39:12,705 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:39:12,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:39:12,706 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:39:12,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:39:12,706 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:39:12,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:39:12,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:39:12,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:39:12,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:39:12,707 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:39:12,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:39:12,707 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:39:12,707 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:39:12,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:39:12,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:39:12,708 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:39:12,708 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:39:12,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:39:12,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:39:12,709 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:39:12,709 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:39:12,709 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:39:12,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:39:12,709 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:39:12,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:39:12,710 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:39:12,710 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:39:13,013 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:39:13,032 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:39:13,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:39:13,037 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:39:13,037 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:39:13,039 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_tso.opt.i [2019-12-27 17:39:13,104 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ada9d2cfc/ef05476d3eeb4fed87bcab6d37ef72de/FLAG4453303ae [2019-12-27 17:39:13,647 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:39:13,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_tso.opt.i [2019-12-27 17:39:13,667 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ada9d2cfc/ef05476d3eeb4fed87bcab6d37ef72de/FLAG4453303ae [2019-12-27 17:39:13,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ada9d2cfc/ef05476d3eeb4fed87bcab6d37ef72de [2019-12-27 17:39:13,936 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:39:13,938 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:39:13,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:39:13,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:39:13,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:39:13,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:39:13" (1/1) ... [2019-12-27 17:39:13,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b447f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:13, skipping insertion in model container [2019-12-27 17:39:13,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:39:13" (1/1) ... [2019-12-27 17:39:13,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:39:14,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:39:14,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:39:14,529 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:39:14,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:39:14,721 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:39:14,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:14 WrapperNode [2019-12-27 17:39:14,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:39:14,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:39:14,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:39:14,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:39:14,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:14" (1/1) ... [2019-12-27 17:39:14,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:14" (1/1) ... [2019-12-27 17:39:14,782 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:39:14,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:39:14,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:39:14,783 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:39:14,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:14" (1/1) ... [2019-12-27 17:39:14,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:14" (1/1) ... [2019-12-27 17:39:14,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:14" (1/1) ... [2019-12-27 17:39:14,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:14" (1/1) ... [2019-12-27 17:39:14,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:14" (1/1) ... [2019-12-27 17:39:14,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:14" (1/1) ... [2019-12-27 17:39:14,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:14" (1/1) ... [2019-12-27 17:39:14,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:39:14,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:39:14,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:39:14,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:39:14,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:39:14,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:39:14,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:39:14,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:39:14,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:39:14,881 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:39:14,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:39:14,881 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:39:14,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:39:14,881 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:39:14,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:39:14,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:39:14,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:39:14,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:39:14,884 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:39:15,664 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:39:15,665 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:39:15,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:39:15 BoogieIcfgContainer [2019-12-27 17:39:15,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:39:15,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:39:15,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:39:15,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:39:15,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:39:13" (1/3) ... [2019-12-27 17:39:15,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287a7bde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:39:15, skipping insertion in model container [2019-12-27 17:39:15,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:14" (2/3) ... [2019-12-27 17:39:15,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287a7bde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:39:15, skipping insertion in model container [2019-12-27 17:39:15,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:39:15" (3/3) ... [2019-12-27 17:39:15,675 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr001_tso.opt.i [2019-12-27 17:39:15,685 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:39:15,686 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:39:15,695 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:39:15,696 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:39:15,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,744 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,744 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,745 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,745 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,746 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,754 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,754 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,778 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,778 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,807 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,809 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,816 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,817 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,817 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,822 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,823 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:15,855 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:39:15,873 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:39:15,873 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:39:15,873 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:39:15,873 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:39:15,873 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:39:15,873 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:39:15,873 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:39:15,874 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:39:15,892 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 17:39:15,896 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 17:39:16,006 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 17:39:16,006 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:39:16,023 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:39:16,049 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 17:39:16,103 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 17:39:16,104 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:39:16,111 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:39:16,132 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 17:39:16,133 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:39:21,244 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 17:39:21,349 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 17:39:21,735 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-27 17:39:21,736 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 17:39:21,739 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-27 17:39:44,513 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-27 17:39:44,515 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-27 17:39:44,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:39:44,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:39:44,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:39:44,526 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:39:44,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:39:44,533 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-27 17:39:44,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:39:44,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331514733] [2019-12-27 17:39:44,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:39:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:39:44,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:39:44,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331514733] [2019-12-27 17:39:44,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:39:44,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:39:44,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [729039524] [2019-12-27 17:39:44,812 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:39:44,817 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:39:44,831 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:39:44,832 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:39:44,836 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:39:44,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:39:44,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:39:44,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:39:44,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:39:44,854 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-27 17:39:48,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:39:48,973 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-27 17:39:48,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:39:48,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:39:48,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:39:49,680 INFO L225 Difference]: With dead ends: 125570 [2019-12-27 17:39:49,680 INFO L226 Difference]: Without dead ends: 111010 [2019-12-27 17:39:49,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:39:54,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-27 17:39:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-27 17:39:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-27 17:39:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-27 17:39:57,928 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-27 17:39:57,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:39:57,929 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-27 17:39:57,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:39:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-27 17:39:57,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:39:57,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:39:57,933 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:39:57,934 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:39:57,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:39:57,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-27 17:39:57,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:39:57,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869197678] [2019-12-27 17:39:57,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:39:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:39:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:39:58,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869197678] [2019-12-27 17:39:58,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:39:58,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:39:58,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1395206263] [2019-12-27 17:39:58,070 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:39:58,071 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:39:58,074 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:39:58,074 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:39:58,075 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:39:58,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:39:58,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:39:58,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:39:58,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:39:58,077 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-27 17:40:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:03,396 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-27 17:40:03,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:40:03,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:40:03,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:04,032 INFO L225 Difference]: With dead ends: 172646 [2019-12-27 17:40:04,032 INFO L226 Difference]: Without dead ends: 172548 [2019-12-27 17:40:04,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:40:10,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-27 17:40:16,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-27 17:40:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-27 17:40:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-27 17:40:17,512 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-27 17:40:17,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:17,512 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-27 17:40:17,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:40:17,513 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-27 17:40:17,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:40:17,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:17,519 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:17,519 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:17,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:17,520 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-27 17:40:17,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:17,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936606451] [2019-12-27 17:40:17,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:40:17,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936606451] [2019-12-27 17:40:17,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:17,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:40:17,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [617013101] [2019-12-27 17:40:17,576 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:17,578 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:17,579 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 17:40:17,579 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:17,580 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:17,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:40:17,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:17,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:40:17,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:40:17,581 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-27 17:40:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:17,749 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-27 17:40:17,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:40:17,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 17:40:17,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:17,804 INFO L225 Difference]: With dead ends: 34208 [2019-12-27 17:40:17,804 INFO L226 Difference]: Without dead ends: 34208 [2019-12-27 17:40:17,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:40:22,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-27 17:40:23,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-27 17:40:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-27 17:40:23,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-27 17:40:23,258 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-27 17:40:23,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:23,259 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-27 17:40:23,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:40:23,259 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-27 17:40:23,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:40:23,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:23,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:23,263 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:23,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:23,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-27 17:40:23,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:23,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974339281] [2019-12-27 17:40:23,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:40:23,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974339281] [2019-12-27 17:40:23,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:23,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:40:23,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [799198357] [2019-12-27 17:40:23,323 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:23,325 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:23,327 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:40:23,328 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:23,328 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:23,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:40:23,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:23,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:40:23,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:40:23,329 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-27 17:40:23,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:23,547 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-27 17:40:23,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:40:23,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 17:40:23,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:23,635 INFO L225 Difference]: With dead ends: 51809 [2019-12-27 17:40:23,635 INFO L226 Difference]: Without dead ends: 51809 [2019-12-27 17:40:23,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:40:23,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-27 17:40:24,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-27 17:40:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-27 17:40:24,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-27 17:40:24,430 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-27 17:40:24,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:24,431 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-27 17:40:24,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:40:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-27 17:40:24,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:40:24,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:24,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:24,435 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:24,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:24,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-27 17:40:24,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:24,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694634382] [2019-12-27 17:40:24,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:24,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:40:24,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694634382] [2019-12-27 17:40:24,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:24,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:40:24,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1083603516] [2019-12-27 17:40:24,516 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:24,518 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:24,521 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:40:24,522 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:24,522 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:24,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:40:24,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:24,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:40:24,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:40:24,523 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-27 17:40:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:25,078 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-27 17:40:25,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:40:25,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 17:40:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:25,171 INFO L225 Difference]: With dead ends: 53507 [2019-12-27 17:40:25,171 INFO L226 Difference]: Without dead ends: 53507 [2019-12-27 17:40:25,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:40:25,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-27 17:40:26,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-27 17:40:26,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-27 17:40:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-27 17:40:26,522 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-27 17:40:26,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:26,522 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-27 17:40:26,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:40:26,522 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-27 17:40:26,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 17:40:26,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:26,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:26,536 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:26,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:26,536 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-27 17:40:26,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:26,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596602925] [2019-12-27 17:40:26,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:40:26,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596602925] [2019-12-27 17:40:26,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:26,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:40:26,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1935478219] [2019-12-27 17:40:26,630 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:26,636 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:26,644 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 17:40:26,645 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:26,694 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:40:26,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:40:26,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:26,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:40:26,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:40:26,695 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 7 states. [2019-12-27 17:40:27,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:27,796 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-27 17:40:27,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:40:27,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 17:40:27,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:27,910 INFO L225 Difference]: With dead ends: 66834 [2019-12-27 17:40:27,910 INFO L226 Difference]: Without dead ends: 66820 [2019-12-27 17:40:27,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:40:28,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-27 17:40:29,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-27 17:40:29,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-27 17:40:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-27 17:40:29,477 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-27 17:40:29,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:29,477 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-27 17:40:29,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:40:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-27 17:40:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:40:29,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:29,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:29,495 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:29,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:29,495 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-27 17:40:29,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:29,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329156085] [2019-12-27 17:40:29,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:29,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:40:29,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329156085] [2019-12-27 17:40:29,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:29,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:40:29,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1816061005] [2019-12-27 17:40:29,561 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:29,564 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:29,574 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 17:40:29,574 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:29,591 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:40:29,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:40:29,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:29,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:40:29,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:40:29,592 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 5 states. [2019-12-27 17:40:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:29,690 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-27 17:40:29,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:40:29,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 17:40:29,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:29,718 INFO L225 Difference]: With dead ends: 18127 [2019-12-27 17:40:29,718 INFO L226 Difference]: Without dead ends: 18127 [2019-12-27 17:40:29,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:40:29,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-27 17:40:29,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-27 17:40:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-27 17:40:30,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-27 17:40:30,009 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-27 17:40:30,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:30,009 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-27 17:40:30,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:40:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-27 17:40:30,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:40:30,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:30,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:30,023 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:30,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:30,024 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-27 17:40:30,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:30,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633762732] [2019-12-27 17:40:30,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:40:30,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633762732] [2019-12-27 17:40:30,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:30,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:40:30,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1133541516] [2019-12-27 17:40:30,120 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:30,125 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:30,131 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:40:30,132 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:30,132 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:30,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:40:30,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:30,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:40:30,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:40:30,133 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-27 17:40:30,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:30,804 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-27 17:40:30,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:40:30,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 17:40:30,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:30,853 INFO L225 Difference]: With dead ends: 25206 [2019-12-27 17:40:30,854 INFO L226 Difference]: Without dead ends: 25206 [2019-12-27 17:40:30,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:40:31,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-27 17:40:31,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-27 17:40:31,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-27 17:40:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-27 17:40:31,347 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-27 17:40:31,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:31,348 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-27 17:40:31,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:40:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-27 17:40:31,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:40:31,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:31,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:31,370 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:31,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:31,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-27 17:40:31,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:31,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031521891] [2019-12-27 17:40:31,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:31,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:40:31,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031521891] [2019-12-27 17:40:31,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:31,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:40:31,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [42047844] [2019-12-27 17:40:31,466 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:31,471 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:31,481 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 17:40:31,482 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:31,501 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:40:31,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:40:31,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:31,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:40:31,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:40:31,502 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 8 states. [2019-12-27 17:40:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:32,748 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-27 17:40:32,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:40:32,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 17:40:32,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:32,792 INFO L225 Difference]: With dead ends: 28185 [2019-12-27 17:40:32,792 INFO L226 Difference]: Without dead ends: 28185 [2019-12-27 17:40:32,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-12-27 17:40:32,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-27 17:40:33,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-27 17:40:33,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-27 17:40:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-27 17:40:33,179 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-27 17:40:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:33,179 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-27 17:40:33,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:40:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-27 17:40:33,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 17:40:33,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:33,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:33,208 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:33,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:33,208 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-27 17:40:33,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:33,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696272766] [2019-12-27 17:40:33,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:40:33,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696272766] [2019-12-27 17:40:33,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:33,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:40:33,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1285197661] [2019-12-27 17:40:33,548 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:33,554 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:33,619 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 287 transitions. [2019-12-27 17:40:33,620 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:33,678 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:40:33,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:40:33,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:33,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:40:33,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:40:33,680 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 7 states. [2019-12-27 17:40:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:33,823 INFO L93 Difference]: Finished difference Result 18279 states and 57074 transitions. [2019-12-27 17:40:33,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:40:33,824 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-27 17:40:33,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:33,868 INFO L225 Difference]: With dead ends: 18279 [2019-12-27 17:40:33,868 INFO L226 Difference]: Without dead ends: 18279 [2019-12-27 17:40:33,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:40:34,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18279 states. [2019-12-27 17:40:34,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18279 to 17698. [2019-12-27 17:40:34,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17698 states. [2019-12-27 17:40:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17698 states to 17698 states and 55505 transitions. [2019-12-27 17:40:34,316 INFO L78 Accepts]: Start accepts. Automaton has 17698 states and 55505 transitions. Word has length 39 [2019-12-27 17:40:34,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:34,316 INFO L462 AbstractCegarLoop]: Abstraction has 17698 states and 55505 transitions. [2019-12-27 17:40:34,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:40:34,316 INFO L276 IsEmpty]: Start isEmpty. Operand 17698 states and 55505 transitions. [2019-12-27 17:40:34,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:40:34,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:34,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:34,341 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:34,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:34,341 INFO L82 PathProgramCache]: Analyzing trace with hash -2116688157, now seen corresponding path program 1 times [2019-12-27 17:40:34,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:34,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091143796] [2019-12-27 17:40:34,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:40:34,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091143796] [2019-12-27 17:40:34,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:34,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:40:34,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1275889460] [2019-12-27 17:40:34,472 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:34,494 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:34,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 313 transitions. [2019-12-27 17:40:34,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:34,743 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:40:34,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:40:34,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:34,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:40:34,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:40:34,745 INFO L87 Difference]: Start difference. First operand 17698 states and 55505 transitions. Second operand 7 states. [2019-12-27 17:40:35,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:35,336 INFO L93 Difference]: Finished difference Result 48537 states and 151835 transitions. [2019-12-27 17:40:35,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:40:35,336 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 17:40:35,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:35,392 INFO L225 Difference]: With dead ends: 48537 [2019-12-27 17:40:35,393 INFO L226 Difference]: Without dead ends: 38006 [2019-12-27 17:40:35,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:40:35,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38006 states. [2019-12-27 17:40:35,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38006 to 21047. [2019-12-27 17:40:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21047 states. [2019-12-27 17:40:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21047 states to 21047 states and 66538 transitions. [2019-12-27 17:40:35,905 INFO L78 Accepts]: Start accepts. Automaton has 21047 states and 66538 transitions. Word has length 64 [2019-12-27 17:40:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:35,905 INFO L462 AbstractCegarLoop]: Abstraction has 21047 states and 66538 transitions. [2019-12-27 17:40:35,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:40:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 21047 states and 66538 transitions. [2019-12-27 17:40:35,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:40:35,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:35,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:35,932 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:35,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:35,932 INFO L82 PathProgramCache]: Analyzing trace with hash -978914267, now seen corresponding path program 2 times [2019-12-27 17:40:35,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:35,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133345035] [2019-12-27 17:40:35,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:40:36,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133345035] [2019-12-27 17:40:36,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:36,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:40:36,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2083480792] [2019-12-27 17:40:36,039 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:36,059 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:36,521 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 326 transitions. [2019-12-27 17:40:36,521 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:36,576 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:40:36,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:40:36,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:36,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:40:36,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:40:36,577 INFO L87 Difference]: Start difference. First operand 21047 states and 66538 transitions. Second operand 10 states. [2019-12-27 17:40:38,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:38,859 INFO L93 Difference]: Finished difference Result 67378 states and 209411 transitions. [2019-12-27 17:40:38,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 17:40:38,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 17:40:38,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:38,947 INFO L225 Difference]: With dead ends: 67378 [2019-12-27 17:40:38,947 INFO L226 Difference]: Without dead ends: 49917 [2019-12-27 17:40:38,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:40:39,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49917 states. [2019-12-27 17:40:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49917 to 24743. [2019-12-27 17:40:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24743 states. [2019-12-27 17:40:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24743 states to 24743 states and 78318 transitions. [2019-12-27 17:40:39,581 INFO L78 Accepts]: Start accepts. Automaton has 24743 states and 78318 transitions. Word has length 64 [2019-12-27 17:40:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:39,581 INFO L462 AbstractCegarLoop]: Abstraction has 24743 states and 78318 transitions. [2019-12-27 17:40:39,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:40:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 24743 states and 78318 transitions. [2019-12-27 17:40:39,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:40:39,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:39,616 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:39,616 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:39,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:39,617 INFO L82 PathProgramCache]: Analyzing trace with hash -423923923, now seen corresponding path program 3 times [2019-12-27 17:40:39,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:39,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124585927] [2019-12-27 17:40:39,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:39,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:40:39,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124585927] [2019-12-27 17:40:39,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:39,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:40:39,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1734327354] [2019-12-27 17:40:39,708 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:39,728 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:39,878 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 267 transitions. [2019-12-27 17:40:39,878 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:39,904 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:40:39,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:40:39,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:39,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:40:39,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:40:39,905 INFO L87 Difference]: Start difference. First operand 24743 states and 78318 transitions. Second operand 9 states. [2019-12-27 17:40:41,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:41,388 INFO L93 Difference]: Finished difference Result 83473 states and 258770 transitions. [2019-12-27 17:40:41,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 17:40:41,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 17:40:41,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:41,507 INFO L225 Difference]: With dead ends: 83473 [2019-12-27 17:40:41,508 INFO L226 Difference]: Without dead ends: 76594 [2019-12-27 17:40:41,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:40:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76594 states. [2019-12-27 17:40:42,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76594 to 24923. [2019-12-27 17:40:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24923 states. [2019-12-27 17:40:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24923 states to 24923 states and 79050 transitions. [2019-12-27 17:40:42,351 INFO L78 Accepts]: Start accepts. Automaton has 24923 states and 79050 transitions. Word has length 64 [2019-12-27 17:40:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:42,351 INFO L462 AbstractCegarLoop]: Abstraction has 24923 states and 79050 transitions. [2019-12-27 17:40:42,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:40:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 24923 states and 79050 transitions. [2019-12-27 17:40:42,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:40:42,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:42,394 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:42,394 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:42,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:42,395 INFO L82 PathProgramCache]: Analyzing trace with hash -314768521, now seen corresponding path program 4 times [2019-12-27 17:40:42,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:42,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286675737] [2019-12-27 17:40:42,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:40:42,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286675737] [2019-12-27 17:40:42,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:42,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:40:42,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2086910649] [2019-12-27 17:40:42,488 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:42,542 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:42,777 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 277 states and 500 transitions. [2019-12-27 17:40:42,778 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:42,785 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:40:42,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:40:42,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:42,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:40:42,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:40:42,786 INFO L87 Difference]: Start difference. First operand 24923 states and 79050 transitions. Second operand 4 states. [2019-12-27 17:40:43,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:43,073 INFO L93 Difference]: Finished difference Result 29331 states and 90024 transitions. [2019-12-27 17:40:43,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:40:43,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 17:40:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:43,117 INFO L225 Difference]: With dead ends: 29331 [2019-12-27 17:40:43,117 INFO L226 Difference]: Without dead ends: 29331 [2019-12-27 17:40:43,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:40:43,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29331 states. [2019-12-27 17:40:43,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29331 to 19827. [2019-12-27 17:40:43,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-12-27 17:40:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 61272 transitions. [2019-12-27 17:40:43,814 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 61272 transitions. Word has length 64 [2019-12-27 17:40:43,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:43,815 INFO L462 AbstractCegarLoop]: Abstraction has 19827 states and 61272 transitions. [2019-12-27 17:40:43,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:40:43,815 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 61272 transitions. [2019-12-27 17:40:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:40:43,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:43,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:43,836 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:43,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:43,836 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-27 17:40:43,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:43,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97057517] [2019-12-27 17:40:43,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:43,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:40:43,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97057517] [2019-12-27 17:40:43,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:43,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:40:43,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1429938317] [2019-12-27 17:40:43,904 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:43,949 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:44,145 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 318 transitions. [2019-12-27 17:40:44,146 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:44,147 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:44,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:40:44,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:44,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:40:44,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:40:44,148 INFO L87 Difference]: Start difference. First operand 19827 states and 61272 transitions. Second operand 3 states. [2019-12-27 17:40:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:44,315 INFO L93 Difference]: Finished difference Result 24197 states and 74265 transitions. [2019-12-27 17:40:44,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:40:44,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 17:40:44,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:44,356 INFO L225 Difference]: With dead ends: 24197 [2019-12-27 17:40:44,356 INFO L226 Difference]: Without dead ends: 24197 [2019-12-27 17:40:44,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:40:44,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24197 states. [2019-12-27 17:40:44,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24197 to 21036. [2019-12-27 17:40:44,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21036 states. [2019-12-27 17:40:44,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 65069 transitions. [2019-12-27 17:40:44,864 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 65069 transitions. Word has length 65 [2019-12-27 17:40:44,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:44,864 INFO L462 AbstractCegarLoop]: Abstraction has 21036 states and 65069 transitions. [2019-12-27 17:40:44,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:40:44,864 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 65069 transitions. [2019-12-27 17:40:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:40:44,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:44,888 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:44,888 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:44,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:44,888 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-27 17:40:44,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:44,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125971818] [2019-12-27 17:40:44,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:40:44,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125971818] [2019-12-27 17:40:44,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:44,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:40:44,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1374910030] [2019-12-27 17:40:44,980 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:45,005 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:45,194 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 289 transitions. [2019-12-27 17:40:45,194 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:45,195 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:45,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:40:45,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:45,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:40:45,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:40:45,196 INFO L87 Difference]: Start difference. First operand 21036 states and 65069 transitions. Second operand 4 states. [2019-12-27 17:40:45,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:45,343 INFO L93 Difference]: Finished difference Result 24621 states and 75632 transitions. [2019-12-27 17:40:45,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:40:45,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 17:40:45,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:45,377 INFO L225 Difference]: With dead ends: 24621 [2019-12-27 17:40:45,378 INFO L226 Difference]: Without dead ends: 24621 [2019-12-27 17:40:45,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:40:45,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24621 states. [2019-12-27 17:40:45,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24621 to 21144. [2019-12-27 17:40:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21144 states. [2019-12-27 17:40:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21144 states to 21144 states and 65300 transitions. [2019-12-27 17:40:45,745 INFO L78 Accepts]: Start accepts. Automaton has 21144 states and 65300 transitions. Word has length 66 [2019-12-27 17:40:45,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:45,745 INFO L462 AbstractCegarLoop]: Abstraction has 21144 states and 65300 transitions. [2019-12-27 17:40:45,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:40:45,745 INFO L276 IsEmpty]: Start isEmpty. Operand 21144 states and 65300 transitions. [2019-12-27 17:40:45,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:40:45,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:45,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:45,997 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:45,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:45,997 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-27 17:40:45,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:45,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667368056] [2019-12-27 17:40:45,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:46,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:40:46,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667368056] [2019-12-27 17:40:46,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:46,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:40:46,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [778542186] [2019-12-27 17:40:46,168 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:46,188 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:46,389 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 321 transitions. [2019-12-27 17:40:46,389 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:46,505 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:40:46,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:40:46,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:46,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:40:46,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:40:46,506 INFO L87 Difference]: Start difference. First operand 21144 states and 65300 transitions. Second operand 12 states. [2019-12-27 17:40:49,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:49,102 INFO L93 Difference]: Finished difference Result 38488 states and 118451 transitions. [2019-12-27 17:40:49,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 17:40:49,102 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 17:40:49,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:49,147 INFO L225 Difference]: With dead ends: 38488 [2019-12-27 17:40:49,147 INFO L226 Difference]: Without dead ends: 30672 [2019-12-27 17:40:49,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2019-12-27 17:40:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30672 states. [2019-12-27 17:40:49,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30672 to 21745. [2019-12-27 17:40:49,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21745 states. [2019-12-27 17:40:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21745 states to 21745 states and 67061 transitions. [2019-12-27 17:40:49,559 INFO L78 Accepts]: Start accepts. Automaton has 21745 states and 67061 transitions. Word has length 66 [2019-12-27 17:40:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:49,559 INFO L462 AbstractCegarLoop]: Abstraction has 21745 states and 67061 transitions. [2019-12-27 17:40:49,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:40:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 21745 states and 67061 transitions. [2019-12-27 17:40:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:40:49,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:49,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:49,584 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:49,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:49,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1421968206, now seen corresponding path program 2 times [2019-12-27 17:40:49,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:49,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165700499] [2019-12-27 17:40:49,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:40:49,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165700499] [2019-12-27 17:40:49,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:49,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:40:49,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [89690315] [2019-12-27 17:40:49,764 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:49,781 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:49,963 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 340 transitions. [2019-12-27 17:40:49,963 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:50,080 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 17:40:50,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:40:50,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:50,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:40:50,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:40:50,081 INFO L87 Difference]: Start difference. First operand 21745 states and 67061 transitions. Second operand 13 states. [2019-12-27 17:40:53,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:53,509 INFO L93 Difference]: Finished difference Result 45951 states and 140703 transitions. [2019-12-27 17:40:53,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 17:40:53,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-27 17:40:53,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:53,567 INFO L225 Difference]: With dead ends: 45951 [2019-12-27 17:40:53,567 INFO L226 Difference]: Without dead ends: 39991 [2019-12-27 17:40:53,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2019-12-27 17:40:53,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39991 states. [2019-12-27 17:40:54,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39991 to 22197. [2019-12-27 17:40:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22197 states. [2019-12-27 17:40:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22197 states to 22197 states and 68309 transitions. [2019-12-27 17:40:54,060 INFO L78 Accepts]: Start accepts. Automaton has 22197 states and 68309 transitions. Word has length 66 [2019-12-27 17:40:54,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:54,061 INFO L462 AbstractCegarLoop]: Abstraction has 22197 states and 68309 transitions. [2019-12-27 17:40:54,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:40:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 22197 states and 68309 transitions. [2019-12-27 17:40:54,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:40:54,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:54,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:54,083 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:54,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:54,084 INFO L82 PathProgramCache]: Analyzing trace with hash 765284024, now seen corresponding path program 3 times [2019-12-27 17:40:54,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:54,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214156431] [2019-12-27 17:40:54,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:40:54,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214156431] [2019-12-27 17:40:54,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:54,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:40:54,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [440082027] [2019-12-27 17:40:54,246 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:54,259 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:54,655 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 301 states and 616 transitions. [2019-12-27 17:40:54,655 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:54,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:40:54,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:40:55,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-27 17:40:55,482 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 17:40:55,484 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 17:40:55,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 17:40:55,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:55,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 17:40:55,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:40:55,485 INFO L87 Difference]: Start difference. First operand 22197 states and 68309 transitions. Second operand 19 states. [2019-12-27 17:40:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:59,202 INFO L93 Difference]: Finished difference Result 34983 states and 107283 transitions. [2019-12-27 17:40:59,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 17:40:59,203 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-12-27 17:40:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:59,249 INFO L225 Difference]: With dead ends: 34983 [2019-12-27 17:40:59,249 INFO L226 Difference]: Without dead ends: 31500 [2019-12-27 17:40:59,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2019-12-27 17:40:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31500 states. [2019-12-27 17:40:59,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31500 to 21765. [2019-12-27 17:40:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21765 states. [2019-12-27 17:40:59,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21765 states to 21765 states and 66977 transitions. [2019-12-27 17:40:59,664 INFO L78 Accepts]: Start accepts. Automaton has 21765 states and 66977 transitions. Word has length 66 [2019-12-27 17:40:59,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:59,664 INFO L462 AbstractCegarLoop]: Abstraction has 21765 states and 66977 transitions. [2019-12-27 17:40:59,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 17:40:59,664 INFO L276 IsEmpty]: Start isEmpty. Operand 21765 states and 66977 transitions. [2019-12-27 17:40:59,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:40:59,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:59,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:59,687 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:59,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:59,687 INFO L82 PathProgramCache]: Analyzing trace with hash 53330666, now seen corresponding path program 4 times [2019-12-27 17:40:59,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:59,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42056086] [2019-12-27 17:40:59,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:59,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:40:59,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42056086] [2019-12-27 17:40:59,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:59,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:40:59,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2429942] [2019-12-27 17:40:59,870 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:59,883 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:00,039 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 323 transitions. [2019-12-27 17:41:00,039 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:00,170 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:41:00,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:41:00,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:00,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:41:00,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:41:00,171 INFO L87 Difference]: Start difference. First operand 21765 states and 66977 transitions. Second operand 14 states. [2019-12-27 17:41:02,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:02,904 INFO L93 Difference]: Finished difference Result 36536 states and 111333 transitions. [2019-12-27 17:41:02,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 17:41:02,905 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 17:41:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:02,948 INFO L225 Difference]: With dead ends: 36536 [2019-12-27 17:41:02,948 INFO L226 Difference]: Without dead ends: 31852 [2019-12-27 17:41:02,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:41:03,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31852 states. [2019-12-27 17:41:03,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31852 to 21989. [2019-12-27 17:41:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21989 states. [2019-12-27 17:41:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21989 states to 21989 states and 67561 transitions. [2019-12-27 17:41:03,756 INFO L78 Accepts]: Start accepts. Automaton has 21989 states and 67561 transitions. Word has length 66 [2019-12-27 17:41:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:03,756 INFO L462 AbstractCegarLoop]: Abstraction has 21989 states and 67561 transitions. [2019-12-27 17:41:03,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:41:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 21989 states and 67561 transitions. [2019-12-27 17:41:03,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:41:03,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:03,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:41:03,786 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:03,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:03,786 INFO L82 PathProgramCache]: Analyzing trace with hash 791396238, now seen corresponding path program 5 times [2019-12-27 17:41:03,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:03,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530679933] [2019-12-27 17:41:03,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:03,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-27 17:41:03,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530679933] [2019-12-27 17:41:03,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:03,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:41:03,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1533969734] [2019-12-27 17:41:03,963 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:03,976 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:04,320 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 305 states and 635 transitions. [2019-12-27 17:41:04,320 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:04,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:41:04,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:41:04,630 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 17:41:04,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 17:41:04,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:04,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 17:41:04,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:41:04,632 INFO L87 Difference]: Start difference. First operand 21989 states and 67561 transitions. Second operand 19 states. [2019-12-27 17:41:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:10,166 INFO L93 Difference]: Finished difference Result 68522 states and 207755 transitions. [2019-12-27 17:41:10,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-27 17:41:10,167 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-12-27 17:41:10,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:10,265 INFO L225 Difference]: With dead ends: 68522 [2019-12-27 17:41:10,265 INFO L226 Difference]: Without dead ends: 65485 [2019-12-27 17:41:10,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=476, Invalid=2946, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 17:41:10,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65485 states. [2019-12-27 17:41:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65485 to 21855. [2019-12-27 17:41:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21855 states. [2019-12-27 17:41:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21855 states to 21855 states and 67213 transitions. [2019-12-27 17:41:11,263 INFO L78 Accepts]: Start accepts. Automaton has 21855 states and 67213 transitions. Word has length 66 [2019-12-27 17:41:11,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:11,263 INFO L462 AbstractCegarLoop]: Abstraction has 21855 states and 67213 transitions. [2019-12-27 17:41:11,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 17:41:11,264 INFO L276 IsEmpty]: Start isEmpty. Operand 21855 states and 67213 transitions. [2019-12-27 17:41:11,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:41:11,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:11,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:41:11,285 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:11,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:11,285 INFO L82 PathProgramCache]: Analyzing trace with hash -315236056, now seen corresponding path program 6 times [2019-12-27 17:41:11,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:11,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631575056] [2019-12-27 17:41:11,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:41:11,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631575056] [2019-12-27 17:41:11,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:11,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:41:11,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [216275146] [2019-12-27 17:41:11,461 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:11,471 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:11,693 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 276 states and 559 transitions. [2019-12-27 17:41:11,694 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:11,923 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 17:41:11,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 17:41:11,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:11,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 17:41:11,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:41:11,924 INFO L87 Difference]: Start difference. First operand 21855 states and 67213 transitions. Second operand 18 states. [2019-12-27 17:41:20,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:20,111 INFO L93 Difference]: Finished difference Result 91067 states and 271432 transitions. [2019-12-27 17:41:20,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-12-27 17:41:20,112 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-27 17:41:20,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:20,211 INFO L225 Difference]: With dead ends: 91067 [2019-12-27 17:41:20,211 INFO L226 Difference]: Without dead ends: 72201 [2019-12-27 17:41:20,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3035 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1140, Invalid=8172, Unknown=0, NotChecked=0, Total=9312 [2019-12-27 17:41:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72201 states. [2019-12-27 17:41:20,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72201 to 24858. [2019-12-27 17:41:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24858 states. [2019-12-27 17:41:20,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24858 states to 24858 states and 76594 transitions. [2019-12-27 17:41:20,980 INFO L78 Accepts]: Start accepts. Automaton has 24858 states and 76594 transitions. Word has length 66 [2019-12-27 17:41:20,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:20,981 INFO L462 AbstractCegarLoop]: Abstraction has 24858 states and 76594 transitions. [2019-12-27 17:41:20,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 17:41:20,981 INFO L276 IsEmpty]: Start isEmpty. Operand 24858 states and 76594 transitions. [2019-12-27 17:41:21,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:41:21,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:21,006 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:41:21,007 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:21,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:21,007 INFO L82 PathProgramCache]: Analyzing trace with hash 99317356, now seen corresponding path program 7 times [2019-12-27 17:41:21,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:21,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69136607] [2019-12-27 17:41:21,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:41:21,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69136607] [2019-12-27 17:41:21,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:21,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:41:21,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [711302369] [2019-12-27 17:41:21,189 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:21,202 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:21,445 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 302 states and 620 transitions. [2019-12-27 17:41:21,446 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:21,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:41:21,708 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 17:41:21,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 17:41:21,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:21,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 17:41:21,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:41:21,709 INFO L87 Difference]: Start difference. First operand 24858 states and 76594 transitions. Second operand 16 states. [2019-12-27 17:41:28,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:28,589 INFO L93 Difference]: Finished difference Result 62896 states and 187451 transitions. [2019-12-27 17:41:28,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-27 17:41:28,590 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 17:41:28,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:28,678 INFO L225 Difference]: With dead ends: 62896 [2019-12-27 17:41:28,679 INFO L226 Difference]: Without dead ends: 62460 [2019-12-27 17:41:28,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=557, Invalid=3225, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 17:41:28,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62460 states. [2019-12-27 17:41:29,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62460 to 29743. [2019-12-27 17:41:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29743 states. [2019-12-27 17:41:29,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29743 states to 29743 states and 90887 transitions. [2019-12-27 17:41:29,441 INFO L78 Accepts]: Start accepts. Automaton has 29743 states and 90887 transitions. Word has length 66 [2019-12-27 17:41:29,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:29,441 INFO L462 AbstractCegarLoop]: Abstraction has 29743 states and 90887 transitions. [2019-12-27 17:41:29,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 17:41:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 29743 states and 90887 transitions. [2019-12-27 17:41:29,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:41:29,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:29,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:41:29,471 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:29,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:29,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1527279588, now seen corresponding path program 8 times [2019-12-27 17:41:29,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:29,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997780801] [2019-12-27 17:41:29,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:41:29,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997780801] [2019-12-27 17:41:29,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:29,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:41:29,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1555689490] [2019-12-27 17:41:29,542 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:29,559 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:29,860 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 270 states and 489 transitions. [2019-12-27 17:41:29,860 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:29,861 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:41:29,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:41:29,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:29,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:41:29,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:41:29,862 INFO L87 Difference]: Start difference. First operand 29743 states and 90887 transitions. Second operand 3 states. [2019-12-27 17:41:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:29,953 INFO L93 Difference]: Finished difference Result 29743 states and 90886 transitions. [2019-12-27 17:41:29,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:41:29,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 17:41:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:29,995 INFO L225 Difference]: With dead ends: 29743 [2019-12-27 17:41:29,995 INFO L226 Difference]: Without dead ends: 29743 [2019-12-27 17:41:29,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:41:30,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29743 states. [2019-12-27 17:41:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29743 to 25259. [2019-12-27 17:41:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25259 states. [2019-12-27 17:41:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25259 states to 25259 states and 78071 transitions. [2019-12-27 17:41:30,871 INFO L78 Accepts]: Start accepts. Automaton has 25259 states and 78071 transitions. Word has length 66 [2019-12-27 17:41:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:30,872 INFO L462 AbstractCegarLoop]: Abstraction has 25259 states and 78071 transitions. [2019-12-27 17:41:30,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:41:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 25259 states and 78071 transitions. [2019-12-27 17:41:30,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:41:30,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:30,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:41:30,900 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:30,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:30,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1823504856, now seen corresponding path program 1 times [2019-12-27 17:41:30,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:30,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247983632] [2019-12-27 17:41:30,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:41:31,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247983632] [2019-12-27 17:41:31,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:31,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:41:31,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1906417944] [2019-12-27 17:41:31,078 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:31,098 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:31,465 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 303 states and 621 transitions. [2019-12-27 17:41:31,465 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:31,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:41:31,942 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 17:41:31,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 17:41:31,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:31,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 17:41:31,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:41:31,943 INFO L87 Difference]: Start difference. First operand 25259 states and 78071 transitions. Second operand 18 states. [2019-12-27 17:41:35,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:35,943 INFO L93 Difference]: Finished difference Result 36258 states and 110121 transitions. [2019-12-27 17:41:35,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 17:41:35,944 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 17:41:35,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:35,994 INFO L225 Difference]: With dead ends: 36258 [2019-12-27 17:41:35,994 INFO L226 Difference]: Without dead ends: 35331 [2019-12-27 17:41:35,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=862, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 17:41:36,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35331 states. [2019-12-27 17:41:36,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35331 to 25243. [2019-12-27 17:41:36,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25243 states. [2019-12-27 17:41:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25243 states to 25243 states and 78015 transitions. [2019-12-27 17:41:36,502 INFO L78 Accepts]: Start accepts. Automaton has 25243 states and 78015 transitions. Word has length 67 [2019-12-27 17:41:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:36,502 INFO L462 AbstractCegarLoop]: Abstraction has 25243 states and 78015 transitions. [2019-12-27 17:41:36,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 17:41:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 25243 states and 78015 transitions. [2019-12-27 17:41:36,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:41:36,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:36,530 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:41:36,531 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:36,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:36,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 2 times [2019-12-27 17:41:36,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:36,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851181080] [2019-12-27 17:41:36,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:41:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:41:36,650 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:41:36,651 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:41:36,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= 0 v_~__unbuffered_p1_EAX~0_44) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1582~0.base_23|) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= v_~main$tmp_guard1~0_48 0) (= 0 v_~z$r_buff0_thd3~0_416) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1582~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1582~0.base_23|) |v_ULTIMATE.start_main_~#t1582~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1582~0.base_23|)) (= v_~z$r_buff0_thd0~0_208 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= v_~z$w_buff0_used~0_900 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1582~0.base_23| 1) |v_#valid_60|) (= 0 v_~__unbuffered_p0_EAX~0_137) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= v_~z$r_buff1_thd1~0_166 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1582~0.base_23| 4) |v_#length_21|) (= v_~z$w_buff0~0_454 0) (= |v_ULTIMATE.start_main_~#t1582~0.offset_17| 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ULTIMATE.start_main_~#t1583~0.base=|v_ULTIMATE.start_main_~#t1583~0.base_19|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_~#t1584~0.base=|v_ULTIMATE.start_main_~#t1584~0.base_17|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1584~0.offset=|v_ULTIMATE.start_main_~#t1584~0.offset_14|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~x~0=v_~x~0_129, ULTIMATE.start_main_~#t1583~0.offset=|v_ULTIMATE.start_main_~#t1583~0.offset_12|, ULTIMATE.start_main_~#t1582~0.base=|v_ULTIMATE.start_main_~#t1582~0.base_23|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ULTIMATE.start_main_~#t1582~0.offset=|v_ULTIMATE.start_main_~#t1582~0.offset_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t1583~0.base, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1584~0.base, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1584~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1583~0.offset, ULTIMATE.start_main_~#t1582~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1582~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:41:36,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1583~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1583~0.base_11|) |v_ULTIMATE.start_main_~#t1583~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1583~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1583~0.base_11| 0)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1583~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1583~0.base_11|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1583~0.base_11|)) (= |v_ULTIMATE.start_main_~#t1583~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1583~0.base=|v_ULTIMATE.start_main_~#t1583~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, ULTIMATE.start_main_~#t1583~0.offset=|v_ULTIMATE.start_main_~#t1583~0.offset_9|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1583~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1583~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 17:41:36,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20 0)) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:41:36,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In1433095857 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1433095857 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out1433095857| ~z$w_buff1~0_In1433095857)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out1433095857| ~z~0_In1433095857)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1433095857, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1433095857, ~z$w_buff1~0=~z$w_buff1~0_In1433095857, ~z~0=~z~0_In1433095857} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1433095857|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1433095857, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1433095857, ~z$w_buff1~0=~z$w_buff1~0_In1433095857, ~z~0=~z~0_In1433095857} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 17:41:36,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 17:41:36,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1584~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1584~0.base_13|) |v_ULTIMATE.start_main_~#t1584~0.offset_11| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1584~0.offset_11| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1584~0.base_13|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1584~0.base_13|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1584~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1584~0.base_13| 1)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1584~0.base_13| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1584~0.base=|v_ULTIMATE.start_main_~#t1584~0.base_13|, ULTIMATE.start_main_~#t1584~0.offset=|v_ULTIMATE.start_main_~#t1584~0.offset_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1584~0.base, ULTIMATE.start_main_~#t1584~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 17:41:36,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1110935946 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1110935946 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-1110935946| 0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1110935946| ~z$w_buff0_used~0_In-1110935946) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1110935946, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1110935946} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1110935946, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1110935946|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1110935946} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 17:41:36,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In287325031 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In287325031 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In287325031 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In287325031 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out287325031| ~z$w_buff1_used~0_In287325031) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out287325031|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In287325031, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In287325031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In287325031, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In287325031} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In287325031, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In287325031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In287325031, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out287325031|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In287325031} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 17:41:36,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2104867527 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In2104867527 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In2104867527 |P1Thread1of1ForFork2_#t~ite13_Out2104867527|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out2104867527|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2104867527, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2104867527} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2104867527, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out2104867527|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2104867527} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 17:41:36,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1523112079 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out-1523112079| ~z$w_buff0_used~0_In-1523112079) (= |P2Thread1of1ForFork0_#t~ite26_In-1523112079| |P2Thread1of1ForFork0_#t~ite26_Out-1523112079|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1523112079 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-1523112079 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-1523112079 256)) (and (= 0 (mod ~z$w_buff1_used~0_In-1523112079 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite27_Out-1523112079| |P2Thread1of1ForFork0_#t~ite26_Out-1523112079|) (= ~z$w_buff0_used~0_In-1523112079 |P2Thread1of1ForFork0_#t~ite26_Out-1523112079|) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1523112079|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1523112079, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1523112079, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1523112079, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1523112079, ~weak$$choice2~0=~weak$$choice2~0_In-1523112079} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1523112079|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1523112079|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1523112079, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1523112079, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1523112079, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1523112079, ~weak$$choice2~0=~weak$$choice2~0_In-1523112079} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 17:41:36,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 17:41:36,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-961841137 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-961841137 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-961841137|)) (and (= ~z$w_buff0_used~0_In-961841137 |P0Thread1of1ForFork1_#t~ite5_Out-961841137|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-961841137, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-961841137} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-961841137|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-961841137, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-961841137} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 17:41:36,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 17:41:36,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out-1186155961| |P2Thread1of1ForFork0_#t~ite38_Out-1186155961|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1186155961 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-1186155961 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out-1186155961| ~z~0_In-1186155961) (or .cse1 .cse2)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out-1186155961| ~z$w_buff1~0_In-1186155961) (not .cse1) (not .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1186155961, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1186155961, ~z$w_buff1~0=~z$w_buff1~0_In-1186155961, ~z~0=~z~0_In-1186155961} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-1186155961|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1186155961|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1186155961, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1186155961, ~z$w_buff1~0=~z$w_buff1~0_In-1186155961, ~z~0=~z~0_In-1186155961} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 17:41:36,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-78355156 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-78355156 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-78355156|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-78355156| ~z$w_buff0_used~0_In-78355156)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-78355156, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-78355156} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-78355156, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-78355156|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-78355156} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 17:41:36,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1143450486 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1143450486 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1143450486 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1143450486 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out1143450486| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite41_Out1143450486| ~z$w_buff1_used~0_In1143450486) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1143450486, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1143450486, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1143450486, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1143450486} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1143450486, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1143450486, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1143450486, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1143450486, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1143450486|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 17:41:36,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In63106525 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In63106525 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out63106525| 0) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In63106525 |P2Thread1of1ForFork0_#t~ite42_Out63106525|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In63106525, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In63106525} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In63106525, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In63106525, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out63106525|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 17:41:36,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In2142236485 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In2142236485 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2142236485 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In2142236485 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In2142236485 |P2Thread1of1ForFork0_#t~ite43_Out2142236485|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out2142236485|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2142236485, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2142236485, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2142236485, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2142236485} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out2142236485|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2142236485, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2142236485, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2142236485, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2142236485} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 17:41:36,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_30|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 17:41:36,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In117082421 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In117082421 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In117082421 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In117082421 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out117082421|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In117082421 |P0Thread1of1ForFork1_#t~ite6_Out117082421|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In117082421, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In117082421, ~z$w_buff1_used~0=~z$w_buff1_used~0_In117082421, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In117082421} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In117082421, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out117082421|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In117082421, ~z$w_buff1_used~0=~z$w_buff1_used~0_In117082421, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In117082421} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 17:41:36,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In2133984953 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2133984953 256)))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out2133984953 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out2133984953 ~z$r_buff0_thd1~0_In2133984953)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2133984953, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2133984953} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2133984953, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out2133984953|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out2133984953} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:41:36,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1286565336 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In1286565336 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In1286565336 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1286565336 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out1286565336| ~z$r_buff1_thd1~0_In1286565336) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out1286565336| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1286565336, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1286565336, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1286565336, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1286565336} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1286565336|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1286565336, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1286565336, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1286565336, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1286565336} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 17:41:36,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_44|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_43|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 17:41:36,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1505643978 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1505643978 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1505643978 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1505643978 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In1505643978 |P1Thread1of1ForFork2_#t~ite14_Out1505643978|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1505643978|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1505643978, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1505643978, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1505643978, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1505643978} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1505643978, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1505643978, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1505643978, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1505643978|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1505643978} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 17:41:36,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_34|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_34|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_33|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 17:41:36,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 17:41:36,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite47_Out1744418625| |ULTIMATE.start_main_#t~ite48_Out1744418625|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1744418625 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1744418625 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite47_Out1744418625| ~z$w_buff1~0_In1744418625)) (and .cse1 (or .cse2 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out1744418625| ~z~0_In1744418625)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1744418625, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1744418625, ~z$w_buff1~0=~z$w_buff1~0_In1744418625, ~z~0=~z~0_In1744418625} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1744418625, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1744418625|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1744418625, ~z$w_buff1~0=~z$w_buff1~0_In1744418625, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1744418625|, ~z~0=~z~0_In1744418625} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 17:41:36,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-760113591 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-760113591 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-760113591 |ULTIMATE.start_main_#t~ite49_Out-760113591|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-760113591|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-760113591, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-760113591} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-760113591, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-760113591, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-760113591|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 17:41:36,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In696354751 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In696354751 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In696354751 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In696354751 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out696354751| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out696354751| ~z$w_buff1_used~0_In696354751)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In696354751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In696354751, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In696354751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In696354751} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out696354751|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In696354751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In696354751, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In696354751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In696354751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 17:41:36,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1849167735 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1849167735 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1849167735|)) (and (= ~z$r_buff0_thd0~0_In-1849167735 |ULTIMATE.start_main_#t~ite51_Out-1849167735|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1849167735, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1849167735} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1849167735, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1849167735|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1849167735} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 17:41:36,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In753550369 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In753550369 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In753550369 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In753550369 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out753550369| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In753550369 |ULTIMATE.start_main_#t~ite52_Out753550369|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In753550369, ~z$w_buff0_used~0=~z$w_buff0_used~0_In753550369, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In753550369, ~z$w_buff1_used~0=~z$w_buff1_used~0_In753550369} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out753550369|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In753550369, ~z$w_buff0_used~0=~z$w_buff0_used~0_In753550369, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In753550369, ~z$w_buff1_used~0=~z$w_buff1_used~0_In753550369} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 17:41:36,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:41:36,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:41:36 BasicIcfg [2019-12-27 17:41:36,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:41:36,771 INFO L168 Benchmark]: Toolchain (without parser) took 142833.80 ms. Allocated memory was 145.8 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 102.0 MB in the beginning and 922.2 MB in the end (delta: -820.2 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 17:41:36,771 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 17:41:36,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.56 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 156.7 MB in the end (delta: -55.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:41:36,772 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.71 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:41:36,773 INFO L168 Benchmark]: Boogie Preprocessor took 40.59 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 151.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:41:36,773 INFO L168 Benchmark]: RCFGBuilder took 843.01 ms. Allocated memory is still 203.4 MB. Free memory was 151.4 MB in the beginning and 101.6 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:41:36,774 INFO L168 Benchmark]: TraceAbstraction took 141101.75 ms. Allocated memory was 203.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.9 MB in the beginning and 922.2 MB in the end (delta: -821.3 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 17:41:36,777 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 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 782.56 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 156.7 MB in the end (delta: -55.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.71 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.59 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 151.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 843.01 ms. Allocated memory is still 203.4 MB. Free memory was 151.4 MB in the beginning and 101.6 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 141101.75 ms. Allocated memory was 203.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.9 MB in the beginning and 922.2 MB in the end (delta: -821.3 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1582, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1583, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1584, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 140.7s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 58.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7492 SDtfs, 11450 SDslu, 35437 SDs, 0 SdLazy, 32058 SolverSat, 749 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 631 GetRequests, 126 SyntacticMatches, 38 SemanticMatches, 467 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5661 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158936occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 366712 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1254 NumberOfCodeBlocks, 1254 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1162 ConstructedInterpolants, 0 QuantifiedInterpolants, 242257 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...