/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/rfi007_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:49:00,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:49:00,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:49:00,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:49:00,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:49:00,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:49:00,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:49:00,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:49:00,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:49:00,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:49:00,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:49:00,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:49:00,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:49:00,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:49:00,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:49:00,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:49:00,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:49:00,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:49:00,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:49:00,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:49:00,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:49:00,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:49:00,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:49:00,573 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:49:00,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:49:00,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:49:00,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:49:00,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:49:00,576 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:49:00,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:49:00,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:49:00,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:49:00,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:49:00,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:49:00,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:49:00,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:49:00,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:49:00,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:49:00,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:49:00,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:49:00,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:49:00,583 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:49:00,597 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:49:00,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:49:00,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:49:00,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:49:00,599 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:49:00,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:49:00,599 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:49:00,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:49:00,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:49:00,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:49:00,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:49:00,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:49:00,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:49:00,601 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:49:00,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:49:00,601 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:49:00,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:49:00,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:49:00,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:49:00,602 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:49:00,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:49:00,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:49:00,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:49:00,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:49:00,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:49:00,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:49:00,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:49:00,603 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:49:00,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:49:00,604 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:49:00,604 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:49:00,865 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:49:00,885 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:49:00,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:49:00,889 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:49:00,890 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:49:00,890 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_pso.oepc.i [2019-12-27 17:49:00,968 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/946554d74/6cf970d21cb14b469e4d58f60caa5e65/FLAG1e32a0f1a [2019-12-27 17:49:01,582 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:49:01,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_pso.oepc.i [2019-12-27 17:49:01,596 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/946554d74/6cf970d21cb14b469e4d58f60caa5e65/FLAG1e32a0f1a [2019-12-27 17:49:01,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/946554d74/6cf970d21cb14b469e4d58f60caa5e65 [2019-12-27 17:49:01,852 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:49:01,854 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:49:01,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:49:01,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:49:01,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:49:01,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:49:01" (1/1) ... [2019-12-27 17:49:01,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@150a9350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:01, skipping insertion in model container [2019-12-27 17:49:01,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:49:01" (1/1) ... [2019-12-27 17:49:01,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:49:01,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:49:02,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:49:02,522 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:49:02,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:49:02,725 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:49:02,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:02 WrapperNode [2019-12-27 17:49:02,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:49:02,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:49:02,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:49:02,727 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:49:02,738 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:49:02" (1/1) ... [2019-12-27 17:49:02,757 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:49:02" (1/1) ... [2019-12-27 17:49:02,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:49:02,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:49:02,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:49:02,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:49:02,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:02" (1/1) ... [2019-12-27 17:49:02,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:02" (1/1) ... [2019-12-27 17:49:02,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:02" (1/1) ... [2019-12-27 17:49:02,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:02" (1/1) ... [2019-12-27 17:49:02,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:02" (1/1) ... [2019-12-27 17:49:02,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:02" (1/1) ... [2019-12-27 17:49:02,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:02" (1/1) ... [2019-12-27 17:49:02,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:49:02,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:49:02,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:49:02,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:49:02,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:02" (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:49:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:49:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:49:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:49:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:49:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:49:02,900 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:49:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:49:02,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:49:02,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:49:02,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:49:02,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:49:02,903 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:49:03,601 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:49:03,602 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:49:03,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:49:03 BoogieIcfgContainer [2019-12-27 17:49:03,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:49:03,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:49:03,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:49:03,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:49:03,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:49:01" (1/3) ... [2019-12-27 17:49:03,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a003a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:49:03, skipping insertion in model container [2019-12-27 17:49:03,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:02" (2/3) ... [2019-12-27 17:49:03,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a003a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:49:03, skipping insertion in model container [2019-12-27 17:49:03,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:49:03" (3/3) ... [2019-12-27 17:49:03,613 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_pso.oepc.i [2019-12-27 17:49:03,624 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:49:03,624 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:49:03,632 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:49:03,633 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:49:03,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,673 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,673 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,673 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,674 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,674 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,684 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,684 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,743 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,744 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,744 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,750 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,753 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:03,769 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:49:03,793 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:49:03,793 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:49:03,793 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:49:03,793 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:49:03,794 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:49:03,794 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:49:03,794 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:49:03,794 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:49:03,816 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 17:49:03,818 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 17:49:03,947 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 17:49:03,947 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:49:03,960 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:49:03,979 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 17:49:04,024 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 17:49:04,024 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:49:04,030 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:49:04,045 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 17:49:04,046 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:49:08,873 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 17:49:08,997 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 17:49:09,369 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-12-27 17:49:09,369 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 17:49:09,373 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-27 17:49:09,962 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-12-27 17:49:09,964 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-12-27 17:49:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:49:09,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:09,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:49:09,972 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:09,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:09,978 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-12-27 17:49:09,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:09,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97904143] [2019-12-27 17:49:09,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:10,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:49:10,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97904143] [2019-12-27 17:49:10,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:10,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:49:10,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1343369088] [2019-12-27 17:49:10,255 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:10,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:10,278 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:49:10,278 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:10,282 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:49:10,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:49:10,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:10,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:49:10,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:49:10,301 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-12-27 17:49:10,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:10,554 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-12-27 17:49:10,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:49:10,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:49:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:10,637 INFO L225 Difference]: With dead ends: 9266 [2019-12-27 17:49:10,637 INFO L226 Difference]: Without dead ends: 8258 [2019-12-27 17:49:10,639 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:49:10,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-12-27 17:49:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-12-27 17:49:11,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-12-27 17:49:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-12-27 17:49:11,153 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-12-27 17:49:11,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:11,154 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-12-27 17:49:11,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:49:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-12-27 17:49:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:49:11,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:11,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:49:11,158 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:11,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:11,159 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-12-27 17:49:11,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:11,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187397000] [2019-12-27 17:49:11,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:49:11,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187397000] [2019-12-27 17:49:11,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:11,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:49:11,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [781526408] [2019-12-27 17:49:11,341 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:11,343 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:11,345 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:49:11,345 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:11,346 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:49:11,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:49:11,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:11,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:49:11,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:49:11,348 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-12-27 17:49:11,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:11,404 INFO L93 Difference]: Finished difference Result 1877 states and 4722 transitions. [2019-12-27 17:49:11,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:49:11,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:49:11,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:11,412 INFO L225 Difference]: With dead ends: 1877 [2019-12-27 17:49:11,413 INFO L226 Difference]: Without dead ends: 1373 [2019-12-27 17:49:11,414 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:49:11,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2019-12-27 17:49:11,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1373. [2019-12-27 17:49:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2019-12-27 17:49:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 3108 transitions. [2019-12-27 17:49:11,448 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 3108 transitions. Word has length 11 [2019-12-27 17:49:11,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:11,449 INFO L462 AbstractCegarLoop]: Abstraction has 1373 states and 3108 transitions. [2019-12-27 17:49:11,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:49:11,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 3108 transitions. [2019-12-27 17:49:11,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:49:11,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:11,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:49:11,451 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:11,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:11,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-12-27 17:49:11,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:11,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645843982] [2019-12-27 17:49:11,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:11,568 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:49:11,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645843982] [2019-12-27 17:49:11,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:11,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:49:11,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [887716333] [2019-12-27 17:49:11,570 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:11,572 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:11,575 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 17:49:11,575 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:11,575 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:49:11,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:49:11,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:11,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:49:11,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:49:11,576 INFO L87 Difference]: Start difference. First operand 1373 states and 3108 transitions. Second operand 4 states. [2019-12-27 17:49:11,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:11,748 INFO L93 Difference]: Finished difference Result 1700 states and 3783 transitions. [2019-12-27 17:49:11,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:49:11,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 17:49:11,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:11,758 INFO L225 Difference]: With dead ends: 1700 [2019-12-27 17:49:11,758 INFO L226 Difference]: Without dead ends: 1700 [2019-12-27 17:49:11,759 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:49:11,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-12-27 17:49:11,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1636. [2019-12-27 17:49:11,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2019-12-27 17:49:11,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 3659 transitions. [2019-12-27 17:49:11,799 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 3659 transitions. Word has length 14 [2019-12-27 17:49:11,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:11,800 INFO L462 AbstractCegarLoop]: Abstraction has 1636 states and 3659 transitions. [2019-12-27 17:49:11,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:49:11,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 3659 transitions. [2019-12-27 17:49:11,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:49:11,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:11,804 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:49:11,804 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:11,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:11,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-12-27 17:49:11,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:11,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387871369] [2019-12-27 17:49:11,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:12,004 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:49:12,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387871369] [2019-12-27 17:49:12,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:12,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:49:12,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [500065421] [2019-12-27 17:49:12,006 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:12,010 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:12,018 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 17:49:12,018 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:12,018 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:49:12,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:49:12,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:12,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:49:12,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:49:12,020 INFO L87 Difference]: Start difference. First operand 1636 states and 3659 transitions. Second operand 6 states. [2019-12-27 17:49:12,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:12,827 INFO L93 Difference]: Finished difference Result 4529 states and 10000 transitions. [2019-12-27 17:49:12,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:49:12,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 17:49:12,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:12,851 INFO L225 Difference]: With dead ends: 4529 [2019-12-27 17:49:12,851 INFO L226 Difference]: Without dead ends: 4494 [2019-12-27 17:49:12,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:49:12,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2019-12-27 17:49:12,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 2196. [2019-12-27 17:49:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2196 states. [2019-12-27 17:49:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 4963 transitions. [2019-12-27 17:49:12,926 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 4963 transitions. Word has length 25 [2019-12-27 17:49:12,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:12,926 INFO L462 AbstractCegarLoop]: Abstraction has 2196 states and 4963 transitions. [2019-12-27 17:49:12,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:49:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 4963 transitions. [2019-12-27 17:49:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 17:49:12,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:12,929 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] [2019-12-27 17:49:12,930 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:12,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:12,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1415860500, now seen corresponding path program 1 times [2019-12-27 17:49:12,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:12,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753451750] [2019-12-27 17:49:12,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:12,981 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:49:12,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753451750] [2019-12-27 17:49:12,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:12,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:49:12,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [44809443] [2019-12-27 17:49:12,982 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:12,987 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:12,995 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 17:49:12,996 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:12,998 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:49:12,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:49:12,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:12,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:49:12,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:49:12,999 INFO L87 Difference]: Start difference. First operand 2196 states and 4963 transitions. Second operand 3 states. [2019-12-27 17:49:13,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:13,023 INFO L93 Difference]: Finished difference Result 2195 states and 4961 transitions. [2019-12-27 17:49:13,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:49:13,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 17:49:13,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:13,036 INFO L225 Difference]: With dead ends: 2195 [2019-12-27 17:49:13,036 INFO L226 Difference]: Without dead ends: 2195 [2019-12-27 17:49:13,036 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:49:13,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2019-12-27 17:49:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 2195. [2019-12-27 17:49:13,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2019-12-27 17:49:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 4961 transitions. [2019-12-27 17:49:13,085 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 4961 transitions. Word has length 26 [2019-12-27 17:49:13,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:13,085 INFO L462 AbstractCegarLoop]: Abstraction has 2195 states and 4961 transitions. [2019-12-27 17:49:13,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:49:13,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 4961 transitions. [2019-12-27 17:49:13,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 17:49:13,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:13,089 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] [2019-12-27 17:49:13,089 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:13,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:13,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-12-27 17:49:13,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:13,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485599514] [2019-12-27 17:49:13,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:13,208 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:49:13,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485599514] [2019-12-27 17:49:13,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:13,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:49:13,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2085641168] [2019-12-27 17:49:13,210 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:13,215 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:13,224 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 17:49:13,224 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:13,225 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:49:13,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:49:13,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:13,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:49:13,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:49:13,226 INFO L87 Difference]: Start difference. First operand 2195 states and 4961 transitions. Second operand 6 states. [2019-12-27 17:49:13,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:13,936 INFO L93 Difference]: Finished difference Result 4412 states and 9625 transitions. [2019-12-27 17:49:13,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:49:13,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 17:49:13,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:13,948 INFO L225 Difference]: With dead ends: 4412 [2019-12-27 17:49:13,948 INFO L226 Difference]: Without dead ends: 4383 [2019-12-27 17:49:13,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:49:13,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2019-12-27 17:49:14,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 2070. [2019-12-27 17:49:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2019-12-27 17:49:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 4705 transitions. [2019-12-27 17:49:14,015 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 4705 transitions. Word has length 26 [2019-12-27 17:49:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:14,016 INFO L462 AbstractCegarLoop]: Abstraction has 2070 states and 4705 transitions. [2019-12-27 17:49:14,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:49:14,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 4705 transitions. [2019-12-27 17:49:14,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:49:14,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:14,019 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:49:14,020 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:14,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:14,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1827812304, now seen corresponding path program 1 times [2019-12-27 17:49:14,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:14,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861538175] [2019-12-27 17:49:14,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:14,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:49:14,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861538175] [2019-12-27 17:49:14,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:14,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:49:14,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [531968233] [2019-12-27 17:49:14,079 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:14,083 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:14,097 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 17:49:14,098 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:14,101 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:49:14,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:49:14,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:14,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:49:14,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:49:14,102 INFO L87 Difference]: Start difference. First operand 2070 states and 4705 transitions. Second operand 3 states. [2019-12-27 17:49:14,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:14,121 INFO L93 Difference]: Finished difference Result 1991 states and 4456 transitions. [2019-12-27 17:49:14,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:49:14,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 17:49:14,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:14,126 INFO L225 Difference]: With dead ends: 1991 [2019-12-27 17:49:14,126 INFO L226 Difference]: Without dead ends: 1991 [2019-12-27 17:49:14,127 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:49:14,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-12-27 17:49:14,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1854. [2019-12-27 17:49:14,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2019-12-27 17:49:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 4184 transitions. [2019-12-27 17:49:14,167 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 4184 transitions. Word has length 27 [2019-12-27 17:49:14,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:14,167 INFO L462 AbstractCegarLoop]: Abstraction has 1854 states and 4184 transitions. [2019-12-27 17:49:14,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:49:14,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 4184 transitions. [2019-12-27 17:49:14,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 17:49:14,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:14,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:49:14,170 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:14,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:14,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-12-27 17:49:14,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:14,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952879453] [2019-12-27 17:49:14,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:14,240 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:49:14,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952879453] [2019-12-27 17:49:14,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:14,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:49:14,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1837617517] [2019-12-27 17:49:14,241 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:14,246 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:14,259 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 17:49:14,259 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:14,311 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:49:14,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:49:14,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:14,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:49:14,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:49:14,312 INFO L87 Difference]: Start difference. First operand 1854 states and 4184 transitions. Second operand 6 states. [2019-12-27 17:49:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:14,362 INFO L93 Difference]: Finished difference Result 968 states and 2169 transitions. [2019-12-27 17:49:14,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:49:14,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 17:49:14,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:14,367 INFO L225 Difference]: With dead ends: 968 [2019-12-27 17:49:14,368 INFO L226 Difference]: Without dead ends: 886 [2019-12-27 17:49:14,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:49:14,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-12-27 17:49:14,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2019-12-27 17:49:14,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2019-12-27 17:49:14,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1985 transitions. [2019-12-27 17:49:14,392 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1985 transitions. Word has length 28 [2019-12-27 17:49:14,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:14,393 INFO L462 AbstractCegarLoop]: Abstraction has 886 states and 1985 transitions. [2019-12-27 17:49:14,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:49:14,393 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1985 transitions. [2019-12-27 17:49:14,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:49:14,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:14,400 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:14,400 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:14,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:14,401 INFO L82 PathProgramCache]: Analyzing trace with hash 551725022, now seen corresponding path program 1 times [2019-12-27 17:49:14,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:14,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534962746] [2019-12-27 17:49:14,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:14,533 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:49:14,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534962746] [2019-12-27 17:49:14,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:14,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:49:14,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [775031610] [2019-12-27 17:49:14,535 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:14,554 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:14,635 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 144 transitions. [2019-12-27 17:49:14,635 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:14,651 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:49:14,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:49:14,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:14,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:49:14,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:49:14,653 INFO L87 Difference]: Start difference. First operand 886 states and 1985 transitions. Second operand 7 states. [2019-12-27 17:49:15,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:15,044 INFO L93 Difference]: Finished difference Result 2885 states and 6293 transitions. [2019-12-27 17:49:15,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 17:49:15,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 17:49:15,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:15,050 INFO L225 Difference]: With dead ends: 2885 [2019-12-27 17:49:15,050 INFO L226 Difference]: Without dead ends: 1947 [2019-12-27 17:49:15,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:49:15,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2019-12-27 17:49:15,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1014. [2019-12-27 17:49:15,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-12-27 17:49:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 2260 transitions. [2019-12-27 17:49:15,081 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 2260 transitions. Word has length 52 [2019-12-27 17:49:15,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:15,081 INFO L462 AbstractCegarLoop]: Abstraction has 1014 states and 2260 transitions. [2019-12-27 17:49:15,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:49:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 2260 transitions. [2019-12-27 17:49:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:49:15,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:15,084 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] [2019-12-27 17:49:15,085 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:15,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:15,085 INFO L82 PathProgramCache]: Analyzing trace with hash -744775922, now seen corresponding path program 2 times [2019-12-27 17:49:15,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:15,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029803968] [2019-12-27 17:49:15,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:15,152 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:49:15,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029803968] [2019-12-27 17:49:15,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:15,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:49:15,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1582260952] [2019-12-27 17:49:15,154 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:15,173 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:15,252 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 146 transitions. [2019-12-27 17:49:15,253 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:15,254 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:49:15,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:49:15,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:15,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:49:15,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:49:15,255 INFO L87 Difference]: Start difference. First operand 1014 states and 2260 transitions. Second operand 3 states. [2019-12-27 17:49:15,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:15,314 INFO L93 Difference]: Finished difference Result 1280 states and 2822 transitions. [2019-12-27 17:49:15,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:49:15,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 17:49:15,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:15,318 INFO L225 Difference]: With dead ends: 1280 [2019-12-27 17:49:15,319 INFO L226 Difference]: Without dead ends: 1280 [2019-12-27 17:49:15,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 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:49:15,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2019-12-27 17:49:15,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 942. [2019-12-27 17:49:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2019-12-27 17:49:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 2088 transitions. [2019-12-27 17:49:15,342 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 2088 transitions. Word has length 52 [2019-12-27 17:49:15,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:15,342 INFO L462 AbstractCegarLoop]: Abstraction has 942 states and 2088 transitions. [2019-12-27 17:49:15,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:49:15,342 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 2088 transitions. [2019-12-27 17:49:15,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:49:15,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:15,345 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] [2019-12-27 17:49:15,346 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:15,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:15,346 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 1 times [2019-12-27 17:49:15,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:15,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82834251] [2019-12-27 17:49:15,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:49:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:49:15,473 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:49:15,473 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:49:15,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_63) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1709~0.base_24|) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1709~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1709~0.base_24|) |v_ULTIMATE.start_main_~#t1709~0.offset_18| 0)) |v_#memory_int_13|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1709~0.base_24| 4)) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= |v_ULTIMATE.start_main_~#t1709~0.offset_18| 0) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= (store .cse0 |v_ULTIMATE.start_main_~#t1709~0.base_24| 1) |v_#valid_45|) (= 0 v_~x$read_delayed_var~0.offset_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t1709~0.base_24|) 0) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ULTIMATE.start_main_~#t1710~0.offset=|v_ULTIMATE.start_main_~#t1710~0.offset_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_~#t1709~0.offset=|v_ULTIMATE.start_main_~#t1709~0.offset_18|, #length=|v_#length_13|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ULTIMATE.start_main_~#t1710~0.base=|v_ULTIMATE.start_main_~#t1710~0.base_16|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1709~0.base=|v_ULTIMATE.start_main_~#t1709~0.base_24|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1710~0.offset, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1709~0.offset, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1710~0.base, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1709~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 17:49:15,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 17:49:15,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1710~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1710~0.base_12|) |v_ULTIMATE.start_main_~#t1710~0.offset_10| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1710~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1710~0.base_12| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1710~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1710~0.offset_10|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1710~0.base_12| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1710~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1710~0.base=|v_ULTIMATE.start_main_~#t1710~0.base_12|, ULTIMATE.start_main_~#t1710~0.offset=|v_ULTIMATE.start_main_~#t1710~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1710~0.base, ULTIMATE.start_main_~#t1710~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 17:49:15,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-684684301 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-684684301 256)))) (or (and (= ~x$w_buff0_used~0_In-684684301 |P0Thread1of1ForFork0_#t~ite5_Out-684684301|) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-684684301| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-684684301, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-684684301} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-684684301|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-684684301, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-684684301} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:49:15,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-223381422 256)))) (or (and (not .cse0) (= ~x$w_buff0~0_In-223381422 |P1Thread1of1ForFork1_#t~ite15_Out-223381422|) (= |P1Thread1of1ForFork1_#t~ite14_In-223381422| |P1Thread1of1ForFork1_#t~ite14_Out-223381422|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-223381422 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd2~0_In-223381422 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-223381422 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In-223381422 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite14_Out-223381422| |P1Thread1of1ForFork1_#t~ite15_Out-223381422|) .cse0 (= ~x$w_buff0~0_In-223381422 |P1Thread1of1ForFork1_#t~ite14_Out-223381422|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-223381422, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-223381422, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-223381422, ~weak$$choice2~0=~weak$$choice2~0_In-223381422, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-223381422, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-223381422|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-223381422} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-223381422, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-223381422, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-223381422, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-223381422|, ~weak$$choice2~0=~weak$$choice2~0_In-223381422, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-223381422, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-223381422|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-223381422} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 17:49:15,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In1234230774 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1234230774 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1234230774 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1234230774 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1234230774| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out1234230774| ~x$w_buff1_used~0_In1234230774) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1234230774, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1234230774, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1234230774, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1234230774} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1234230774|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1234230774, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1234230774, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1234230774, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1234230774} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:49:15,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-903509337 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-903509337 256)))) (or (and (= ~x$r_buff0_thd1~0_Out-903509337 ~x$r_buff0_thd1~0_In-903509337) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~x$r_buff0_thd1~0_Out-903509337)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-903509337, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-903509337} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-903509337, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-903509337|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-903509337} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 17:49:15,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In730809153 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In730809153 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In730809153 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In730809153 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out730809153|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In730809153 |P0Thread1of1ForFork0_#t~ite8_Out730809153|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In730809153, ~x$w_buff1_used~0=~x$w_buff1_used~0_In730809153, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In730809153, ~x$w_buff0_used~0=~x$w_buff0_used~0_In730809153} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In730809153, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out730809153|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In730809153, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In730809153, ~x$w_buff0_used~0=~x$w_buff0_used~0_In730809153} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:49:15,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 17:49:15,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-924027957 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out-924027957| ~x$w_buff1~0_In-924027957) (= |P1Thread1of1ForFork1_#t~ite17_In-924027957| |P1Thread1of1ForFork1_#t~ite17_Out-924027957|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-924027957 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-924027957 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-924027957 256)) (and (= 0 (mod ~x$r_buff1_thd2~0_In-924027957 256)) .cse1))) .cse0 (= ~x$w_buff1~0_In-924027957 |P1Thread1of1ForFork1_#t~ite17_Out-924027957|) (= |P1Thread1of1ForFork1_#t~ite18_Out-924027957| |P1Thread1of1ForFork1_#t~ite17_Out-924027957|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-924027957, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-924027957, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-924027957, ~weak$$choice2~0=~weak$$choice2~0_In-924027957, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-924027957, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-924027957|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-924027957} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-924027957|, ~x$w_buff1~0=~x$w_buff1~0_In-924027957, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-924027957, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-924027957, ~weak$$choice2~0=~weak$$choice2~0_In-924027957, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-924027957, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-924027957|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-924027957} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 17:49:15,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2090316926 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In-2090316926| |P1Thread1of1ForFork1_#t~ite20_Out-2090316926|) (not .cse0) (= ~x$w_buff0_used~0_In-2090316926 |P1Thread1of1ForFork1_#t~ite21_Out-2090316926|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-2090316926 256) 0))) (or (and .cse1 (= (mod ~x$r_buff1_thd2~0_In-2090316926 256) 0)) (and (= 0 (mod ~x$w_buff1_used~0_In-2090316926 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-2090316926 256)))) (= ~x$w_buff0_used~0_In-2090316926 |P1Thread1of1ForFork1_#t~ite20_Out-2090316926|) .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out-2090316926| |P1Thread1of1ForFork1_#t~ite20_Out-2090316926|)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-2090316926|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2090316926, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2090316926, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2090316926, ~weak$$choice2~0=~weak$$choice2~0_In-2090316926, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2090316926} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-2090316926|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2090316926, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2090316926, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-2090316926|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2090316926, ~weak$$choice2~0=~weak$$choice2~0_In-2090316926, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2090316926} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 17:49:15,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 17:49:15,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In524239560 256) 0))) (or (and (not .cse0) (= ~x$r_buff1_thd2~0_In524239560 |P1Thread1of1ForFork1_#t~ite30_Out524239560|) (= |P1Thread1of1ForFork1_#t~ite29_In524239560| |P1Thread1of1ForFork1_#t~ite29_Out524239560|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out524239560| |P1Thread1of1ForFork1_#t~ite30_Out524239560|) .cse0 (= ~x$r_buff1_thd2~0_In524239560 |P1Thread1of1ForFork1_#t~ite29_Out524239560|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In524239560 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In524239560 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In524239560 256))) (= 0 (mod ~x$w_buff0_used~0_In524239560 256))))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In524239560|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In524239560, ~x$w_buff1_used~0=~x$w_buff1_used~0_In524239560, ~weak$$choice2~0=~weak$$choice2~0_In524239560, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In524239560, ~x$w_buff0_used~0=~x$w_buff0_used~0_In524239560} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out524239560|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out524239560|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In524239560, ~x$w_buff1_used~0=~x$w_buff1_used~0_In524239560, ~weak$$choice2~0=~weak$$choice2~0_In524239560, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In524239560, ~x$w_buff0_used~0=~x$w_buff0_used~0_In524239560} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 17:49:15,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-27 17:49:15,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1392361782 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1392361782 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-1392361782| ~x~0_In-1392361782) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-1392361782| ~x$w_buff1~0_In-1392361782) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1392361782, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1392361782, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1392361782, ~x~0=~x~0_In-1392361782} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1392361782, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1392361782, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1392361782, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1392361782|, ~x~0=~x~0_In-1392361782} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 17:49:15,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 17:49:15,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1985592263 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1985592263 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1985592263 |P1Thread1of1ForFork1_#t~ite34_Out1985592263|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1985592263|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1985592263, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1985592263} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1985592263|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1985592263, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1985592263} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 17:49:15,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-993017127 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-993017127 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-993017127 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-993017127 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-993017127| 0)) (and (= ~x$w_buff1_used~0_In-993017127 |P1Thread1of1ForFork1_#t~ite35_Out-993017127|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-993017127, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-993017127, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-993017127, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-993017127} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-993017127, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-993017127, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-993017127|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-993017127, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-993017127} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 17:49:15,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1690148816 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1690148816 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1690148816| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1690148816| ~x$r_buff0_thd2~0_In-1690148816)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1690148816, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1690148816} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1690148816, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1690148816|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1690148816} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 17:49:15,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-558041887 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-558041887 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-558041887 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-558041887 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-558041887| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out-558041887| ~x$r_buff1_thd2~0_In-558041887) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-558041887, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-558041887, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-558041887, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-558041887} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-558041887, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-558041887, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-558041887, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-558041887|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-558041887} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 17:49:15,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 17:49:15,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:49:15,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In974339300 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In974339300 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In974339300 |ULTIMATE.start_main_#t~ite40_Out974339300|)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In974339300 |ULTIMATE.start_main_#t~ite40_Out974339300|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In974339300, ~x$w_buff1_used~0=~x$w_buff1_used~0_In974339300, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In974339300, ~x~0=~x~0_In974339300} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out974339300|, ~x$w_buff1~0=~x$w_buff1~0_In974339300, ~x$w_buff1_used~0=~x$w_buff1_used~0_In974339300, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In974339300, ~x~0=~x~0_In974339300} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 17:49:15,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-27 17:49:15,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In959268307 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In959268307 256)))) (or (and (= ~x$w_buff0_used~0_In959268307 |ULTIMATE.start_main_#t~ite42_Out959268307|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out959268307| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In959268307, ~x$w_buff0_used~0=~x$w_buff0_used~0_In959268307} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In959268307, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out959268307|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In959268307} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:49:15,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1525477992 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1525477992 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1525477992 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1525477992 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1525477992|)) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1525477992 |ULTIMATE.start_main_#t~ite43_Out1525477992|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1525477992, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1525477992, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1525477992, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1525477992} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1525477992, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1525477992, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1525477992|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1525477992, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1525477992} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 17:49:15,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1006918166 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1006918166 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out1006918166|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In1006918166 |ULTIMATE.start_main_#t~ite44_Out1006918166|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1006918166, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1006918166} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1006918166, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1006918166|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1006918166} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 17:49:15,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-1347604041 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-1347604041 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1347604041 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1347604041 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1347604041|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-1347604041| ~x$r_buff1_thd0~0_In-1347604041)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1347604041, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1347604041, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1347604041, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1347604041} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1347604041, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1347604041, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1347604041, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1347604041|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1347604041} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 17:49:15,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_20 0) (= v_~y~0_126 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 2 v_~__unbuffered_p1_EAX~0_27) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:49:15,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:49:15 BasicIcfg [2019-12-27 17:49:15,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:49:15,561 INFO L168 Benchmark]: Toolchain (without parser) took 13707.39 ms. Allocated memory was 146.3 MB in the beginning and 422.6 MB in the end (delta: 276.3 MB). Free memory was 102.4 MB in the beginning and 91.2 MB in the end (delta: 11.3 MB). Peak memory consumption was 287.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:49:15,562 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 17:49:15,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 871.20 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 102.2 MB in the beginning and 159.0 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 17:49:15,564 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.33 ms. Allocated memory is still 205.0 MB. Free memory was 159.0 MB in the beginning and 156.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:49:15,565 INFO L168 Benchmark]: Boogie Preprocessor took 37.47 ms. Allocated memory is still 205.0 MB. Free memory was 156.4 MB in the beginning and 154.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:49:15,565 INFO L168 Benchmark]: RCFGBuilder took 769.63 ms. Allocated memory is still 205.0 MB. Free memory was 154.4 MB in the beginning and 110.2 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:49:15,566 INFO L168 Benchmark]: TraceAbstraction took 11954.65 ms. Allocated memory was 205.0 MB in the beginning and 422.6 MB in the end (delta: 217.6 MB). Free memory was 109.5 MB in the beginning and 91.2 MB in the end (delta: 18.3 MB). Peak memory consumption was 235.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:49:15,575 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.17 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 871.20 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 102.2 MB in the beginning and 159.0 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.33 ms. Allocated memory is still 205.0 MB. Free memory was 159.0 MB in the beginning and 156.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.47 ms. Allocated memory is still 205.0 MB. Free memory was 156.4 MB in the beginning and 154.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 769.63 ms. Allocated memory is still 205.0 MB. Free memory was 154.4 MB in the beginning and 110.2 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11954.65 ms. Allocated memory was 205.0 MB in the beginning and 422.6 MB in the end (delta: 217.6 MB). Free memory was 109.5 MB in the beginning and 91.2 MB in the end (delta: 18.3 MB). Peak memory consumption was 235.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1709, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1710, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.6s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1290 SDtfs, 1394 SDslu, 2760 SDs, 0 SdLazy, 1231 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 18 SyntacticMatches, 9 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9438occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 6083 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 29194 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...