/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:20:38,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:20:38,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:20:38,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:20:38,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:20:38,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:20:38,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:20:38,807 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:20:38,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:20:38,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:20:38,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:20:38,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:20:38,817 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:20:38,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:20:38,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:20:38,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:20:38,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:20:38,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:20:38,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:20:38,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:20:38,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:20:38,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:20:38,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:20:38,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:20:38,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:20:38,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:20:38,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:20:38,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:20:38,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:20:38,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:20:38,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:20:38,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:20:38,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:20:38,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:20:38,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:20:38,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:20:38,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:20:38,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:20:38,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:20:38,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:20:38,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:20:38,849 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:20:38,862 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:20:38,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:20:38,863 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:20:38,864 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:20:38,864 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:20:38,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:20:38,864 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:20:38,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:20:38,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:20:38,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:20:38,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:20:38,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:20:38,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:20:38,866 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:20:38,866 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:20:38,866 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:20:38,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:20:38,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:20:38,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:20:38,867 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:20:38,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:20:38,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:20:38,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:20:38,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:20:38,868 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:20:38,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:20:38,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:20:38,868 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:20:38,868 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:20:38,868 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:20:38,869 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:20:38,869 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:20:39,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:20:39,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:20:39,141 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:20:39,142 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:20:39,142 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:20:39,143 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.opt.i [2019-12-27 20:20:39,214 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff50ba980/4cd90420dba44de18e54d2e356d7fca7/FLAG0b0075a05 [2019-12-27 20:20:39,701 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:20:39,702 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.opt.i [2019-12-27 20:20:39,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff50ba980/4cd90420dba44de18e54d2e356d7fca7/FLAG0b0075a05 [2019-12-27 20:20:39,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff50ba980/4cd90420dba44de18e54d2e356d7fca7 [2019-12-27 20:20:39,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:20:39,969 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:20:39,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:20:39,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:20:39,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:20:39,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:20:39" (1/1) ... [2019-12-27 20:20:39,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b24d656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:20:39, skipping insertion in model container [2019-12-27 20:20:39,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:20:39" (1/1) ... [2019-12-27 20:20:39,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:20:40,053 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:20:40,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:20:40,540 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:20:40,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:20:40,693 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:20:40,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:20:40 WrapperNode [2019-12-27 20:20:40,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:20:40,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:20:40,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:20:40,695 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:20:40,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:20:40" (1/1) ... [2019-12-27 20:20:40,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:20:40" (1/1) ... [2019-12-27 20:20:40,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:20:40,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:20:40,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:20:40,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:20:40,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:20:40" (1/1) ... [2019-12-27 20:20:40,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:20:40" (1/1) ... [2019-12-27 20:20:40,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:20:40" (1/1) ... [2019-12-27 20:20:40,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:20:40" (1/1) ... [2019-12-27 20:20:40,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:20:40" (1/1) ... [2019-12-27 20:20:40,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:20:40" (1/1) ... [2019-12-27 20:20:40,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:20:40" (1/1) ... [2019-12-27 20:20:40,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:20:40,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:20:40,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:20:40,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:20:40,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:20:40" (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 20:20:40,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:20:40,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:20:40,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:20:40,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:20:40,886 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:20:40,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:20:40,887 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:20:40,888 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:20:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:20:40,889 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:20:40,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:20:40,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:20:40,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:20:40,891 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 20:20:41,938 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:20:41,938 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:20:41,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:20:41 BoogieIcfgContainer [2019-12-27 20:20:41,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:20:41,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:20:41,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:20:41,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:20:41,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:20:39" (1/3) ... [2019-12-27 20:20:41,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1ac79d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:20:41, skipping insertion in model container [2019-12-27 20:20:41,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:20:40" (2/3) ... [2019-12-27 20:20:41,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1ac79d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:20:41, skipping insertion in model container [2019-12-27 20:20:41,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:20:41" (3/3) ... [2019-12-27 20:20:41,954 INFO L109 eAbstractionObserver]: Analyzing ICFG mix019_tso.opt.i [2019-12-27 20:20:41,965 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:20:41,965 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:20:41,978 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:20:41,979 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:20:42,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,041 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,041 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,043 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,046 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,083 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,083 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,084 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,084 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,084 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,110 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,110 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,114 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,117 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,120 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,121 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,123 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:20:42,141 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:20:42,169 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:20:42,169 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:20:42,170 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:20:42,170 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:20:42,170 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:20:42,170 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:20:42,170 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:20:42,170 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:20:42,193 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 240 transitions [2019-12-27 20:20:42,195 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 194 places, 240 transitions [2019-12-27 20:20:42,314 INFO L132 PetriNetUnfolder]: 56/237 cut-off events. [2019-12-27 20:20:42,315 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:20:42,335 INFO L76 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 237 events. 56/237 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 559 event pairs. 0/179 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 20:20:42,368 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 194 places, 240 transitions [2019-12-27 20:20:42,431 INFO L132 PetriNetUnfolder]: 56/237 cut-off events. [2019-12-27 20:20:42,431 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:20:42,443 INFO L76 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 237 events. 56/237 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 559 event pairs. 0/179 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 20:20:42,478 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-27 20:20:42,479 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:20:42,767 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-12-27 20:20:46,168 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 20:20:46,292 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:20:46,402 INFO L206 etLargeBlockEncoding]: Checked pairs total: 133002 [2019-12-27 20:20:46,402 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-27 20:20:46,406 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 134 transitions [2019-12-27 20:20:51,365 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 52598 states. [2019-12-27 20:20:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 52598 states. [2019-12-27 20:20:51,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 20:20:51,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:51,374 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:20:51,375 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:20:51,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:51,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2119171218, now seen corresponding path program 1 times [2019-12-27 20:20:51,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:51,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600608323] [2019-12-27 20:20:51,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:51,639 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 20:20:51,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600608323] [2019-12-27 20:20:51,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:51,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:20:51,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [808095165] [2019-12-27 20:20:51,644 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:51,651 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:51,667 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 20:20:51,668 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:51,672 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:20:51,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:20:51,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:51,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:20:51,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:20:51,690 INFO L87 Difference]: Start difference. First operand 52598 states. Second operand 3 states. [2019-12-27 20:20:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:52,724 INFO L93 Difference]: Finished difference Result 51886 states and 211358 transitions. [2019-12-27 20:20:52,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:20:52,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 20:20:52,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:53,138 INFO L225 Difference]: With dead ends: 51886 [2019-12-27 20:20:53,138 INFO L226 Difference]: Without dead ends: 48542 [2019-12-27 20:20:53,142 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 20:20:55,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48542 states. [2019-12-27 20:20:56,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48542 to 48542. [2019-12-27 20:20:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48542 states. [2019-12-27 20:20:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48542 states to 48542 states and 197610 transitions. [2019-12-27 20:20:57,149 INFO L78 Accepts]: Start accepts. Automaton has 48542 states and 197610 transitions. Word has length 7 [2019-12-27 20:20:57,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:57,150 INFO L462 AbstractCegarLoop]: Abstraction has 48542 states and 197610 transitions. [2019-12-27 20:20:57,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:20:57,150 INFO L276 IsEmpty]: Start isEmpty. Operand 48542 states and 197610 transitions. [2019-12-27 20:20:57,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:20:57,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:57,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:20:57,161 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:20:57,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:57,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1592323137, now seen corresponding path program 1 times [2019-12-27 20:20:57,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:57,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935087179] [2019-12-27 20:20:57,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:57,283 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 20:20:57,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935087179] [2019-12-27 20:20:57,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:57,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:20:57,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [436911016] [2019-12-27 20:20:57,284 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:57,286 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:57,289 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:20:57,289 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:57,290 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:20:57,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:20:57,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:57,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:20:57,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:20:57,293 INFO L87 Difference]: Start difference. First operand 48542 states and 197610 transitions. Second operand 3 states. [2019-12-27 20:20:57,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:57,586 INFO L93 Difference]: Finished difference Result 27118 states and 96620 transitions. [2019-12-27 20:20:57,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:20:57,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:20:57,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:57,743 INFO L225 Difference]: With dead ends: 27118 [2019-12-27 20:20:57,744 INFO L226 Difference]: Without dead ends: 27118 [2019-12-27 20:20:57,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:20:58,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27118 states. [2019-12-27 20:21:00,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27118 to 27118. [2019-12-27 20:21:00,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27118 states. [2019-12-27 20:21:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27118 states to 27118 states and 96620 transitions. [2019-12-27 20:21:00,712 INFO L78 Accepts]: Start accepts. Automaton has 27118 states and 96620 transitions. Word has length 13 [2019-12-27 20:21:00,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:00,712 INFO L462 AbstractCegarLoop]: Abstraction has 27118 states and 96620 transitions. [2019-12-27 20:21:00,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:21:00,713 INFO L276 IsEmpty]: Start isEmpty. Operand 27118 states and 96620 transitions. [2019-12-27 20:21:00,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:21:00,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:00,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:00,719 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:00,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:00,720 INFO L82 PathProgramCache]: Analyzing trace with hash 626497651, now seen corresponding path program 1 times [2019-12-27 20:21:00,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:00,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454511401] [2019-12-27 20:21:00,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:00,833 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 20:21:00,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454511401] [2019-12-27 20:21:00,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:00,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:21:00,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1419783576] [2019-12-27 20:21:00,834 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:00,836 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:00,839 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 20:21:00,839 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:00,890 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:21:00,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:21:00,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:00,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:21:00,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:21:00,892 INFO L87 Difference]: Start difference. First operand 27118 states and 96620 transitions. Second operand 5 states. [2019-12-27 20:21:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:00,960 INFO L93 Difference]: Finished difference Result 4626 states and 13431 transitions. [2019-12-27 20:21:00,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:21:00,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:21:00,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:00,976 INFO L225 Difference]: With dead ends: 4626 [2019-12-27 20:21:00,976 INFO L226 Difference]: Without dead ends: 4626 [2019-12-27 20:21:00,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:21:00,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2019-12-27 20:21:01,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 4626. [2019-12-27 20:21:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4626 states. [2019-12-27 20:21:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4626 states to 4626 states and 13431 transitions. [2019-12-27 20:21:01,065 INFO L78 Accepts]: Start accepts. Automaton has 4626 states and 13431 transitions. Word has length 14 [2019-12-27 20:21:01,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:01,065 INFO L462 AbstractCegarLoop]: Abstraction has 4626 states and 13431 transitions. [2019-12-27 20:21:01,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:21:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 4626 states and 13431 transitions. [2019-12-27 20:21:01,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:21:01,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:01,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:01,067 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:01,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:01,068 INFO L82 PathProgramCache]: Analyzing trace with hash 20982670, now seen corresponding path program 1 times [2019-12-27 20:21:01,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:01,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850209851] [2019-12-27 20:21:01,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:01,192 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 20:21:01,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850209851] [2019-12-27 20:21:01,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:01,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:21:01,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [495255815] [2019-12-27 20:21:01,193 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:01,195 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:01,198 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 20:21:01,199 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:01,245 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:21:01,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:21:01,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:01,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:21:01,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:21:01,247 INFO L87 Difference]: Start difference. First operand 4626 states and 13431 transitions. Second operand 5 states. [2019-12-27 20:21:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:01,605 INFO L93 Difference]: Finished difference Result 6112 states and 17337 transitions. [2019-12-27 20:21:01,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:21:01,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 20:21:01,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:01,625 INFO L225 Difference]: With dead ends: 6112 [2019-12-27 20:21:01,625 INFO L226 Difference]: Without dead ends: 6112 [2019-12-27 20:21:01,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:21:01,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6112 states. [2019-12-27 20:21:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6112 to 6000. [2019-12-27 20:21:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6000 states. [2019-12-27 20:21:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6000 states to 6000 states and 17130 transitions. [2019-12-27 20:21:01,967 INFO L78 Accepts]: Start accepts. Automaton has 6000 states and 17130 transitions. Word has length 16 [2019-12-27 20:21:01,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:01,967 INFO L462 AbstractCegarLoop]: Abstraction has 6000 states and 17130 transitions. [2019-12-27 20:21:01,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:21:01,968 INFO L276 IsEmpty]: Start isEmpty. Operand 6000 states and 17130 transitions. [2019-12-27 20:21:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 20:21:01,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:01,981 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:01,982 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:01,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:01,988 INFO L82 PathProgramCache]: Analyzing trace with hash -413486290, now seen corresponding path program 1 times [2019-12-27 20:21:01,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:01,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358858319] [2019-12-27 20:21:01,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:02,117 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 20:21:02,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358858319] [2019-12-27 20:21:02,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:02,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:21:02,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [591270100] [2019-12-27 20:21:02,119 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:02,126 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:02,160 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 235 transitions. [2019-12-27 20:21:02,160 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:02,381 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:21:02,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:21:02,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:02,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:21:02,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:21:02,383 INFO L87 Difference]: Start difference. First operand 6000 states and 17130 transitions. Second operand 11 states. [2019-12-27 20:21:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:03,183 INFO L93 Difference]: Finished difference Result 4852 states and 14153 transitions. [2019-12-27 20:21:03,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 20:21:03,183 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2019-12-27 20:21:03,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:03,195 INFO L225 Difference]: With dead ends: 4852 [2019-12-27 20:21:03,195 INFO L226 Difference]: Without dead ends: 4772 [2019-12-27 20:21:03,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:21:03,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4772 states. [2019-12-27 20:21:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4772 to 4658. [2019-12-27 20:21:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4658 states. [2019-12-27 20:21:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4658 states to 4658 states and 13826 transitions. [2019-12-27 20:21:03,287 INFO L78 Accepts]: Start accepts. Automaton has 4658 states and 13826 transitions. Word has length 31 [2019-12-27 20:21:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:03,288 INFO L462 AbstractCegarLoop]: Abstraction has 4658 states and 13826 transitions. [2019-12-27 20:21:03,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:21:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 4658 states and 13826 transitions. [2019-12-27 20:21:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 20:21:03,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:03,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:03,302 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:03,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:03,303 INFO L82 PathProgramCache]: Analyzing trace with hash -892025899, now seen corresponding path program 1 times [2019-12-27 20:21:03,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:03,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787461400] [2019-12-27 20:21:03,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:03,434 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 20:21:03,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787461400] [2019-12-27 20:21:03,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:03,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:21:03,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [298579217] [2019-12-27 20:21:03,435 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:03,458 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:03,579 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 174 states and 308 transitions. [2019-12-27 20:21:03,580 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:03,618 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:21:03,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:21:03,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:03,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:21:03,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:21:03,620 INFO L87 Difference]: Start difference. First operand 4658 states and 13826 transitions. Second operand 6 states. [2019-12-27 20:21:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:04,169 INFO L93 Difference]: Finished difference Result 10153 states and 32123 transitions. [2019-12-27 20:21:04,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:21:04,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-27 20:21:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:04,184 INFO L225 Difference]: With dead ends: 10153 [2019-12-27 20:21:04,185 INFO L226 Difference]: Without dead ends: 5654 [2019-12-27 20:21:04,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:21:04,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5654 states. [2019-12-27 20:21:04,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5654 to 3944. [2019-12-27 20:21:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3944 states. [2019-12-27 20:21:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 9900 transitions. [2019-12-27 20:21:04,281 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 9900 transitions. Word has length 61 [2019-12-27 20:21:04,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:04,283 INFO L462 AbstractCegarLoop]: Abstraction has 3944 states and 9900 transitions. [2019-12-27 20:21:04,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:21:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 9900 transitions. [2019-12-27 20:21:04,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 20:21:04,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:04,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:04,294 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:04,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:04,295 INFO L82 PathProgramCache]: Analyzing trace with hash 22208489, now seen corresponding path program 2 times [2019-12-27 20:21:04,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:04,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957207026] [2019-12-27 20:21:04,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:04,410 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 20:21:04,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957207026] [2019-12-27 20:21:04,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:04,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:21:04,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [551195965] [2019-12-27 20:21:04,412 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:04,430 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:04,566 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 277 transitions. [2019-12-27 20:21:04,566 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:04,567 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:21:04,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:21:04,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:04,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:21:04,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:21:04,569 INFO L87 Difference]: Start difference. First operand 3944 states and 9900 transitions. Second operand 3 states. [2019-12-27 20:21:04,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:04,592 INFO L93 Difference]: Finished difference Result 4441 states and 10994 transitions. [2019-12-27 20:21:04,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:21:04,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-27 20:21:04,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:04,594 INFO L225 Difference]: With dead ends: 4441 [2019-12-27 20:21:04,594 INFO L226 Difference]: Without dead ends: 568 [2019-12-27 20:21:04,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:21:04,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-12-27 20:21:04,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-12-27 20:21:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-12-27 20:21:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 1201 transitions. [2019-12-27 20:21:04,603 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 1201 transitions. Word has length 61 [2019-12-27 20:21:04,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:04,603 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 1201 transitions. [2019-12-27 20:21:04,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:21:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1201 transitions. [2019-12-27 20:21:04,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 20:21:04,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:04,605 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:04,605 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:04,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:04,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1015779399, now seen corresponding path program 3 times [2019-12-27 20:21:04,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:04,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062982292] [2019-12-27 20:21:04,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:04,696 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 20:21:04,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062982292] [2019-12-27 20:21:04,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:04,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:21:04,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1279658330] [2019-12-27 20:21:04,697 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:04,714 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:04,827 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 271 transitions. [2019-12-27 20:21:04,827 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:04,827 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:21:04,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:21:04,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:04,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:21:04,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:21:04,828 INFO L87 Difference]: Start difference. First operand 568 states and 1201 transitions. Second operand 5 states. [2019-12-27 20:21:05,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:05,004 INFO L93 Difference]: Finished difference Result 1125 states and 2390 transitions. [2019-12-27 20:21:05,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:21:05,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-12-27 20:21:05,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:05,005 INFO L225 Difference]: With dead ends: 1125 [2019-12-27 20:21:05,006 INFO L226 Difference]: Without dead ends: 568 [2019-12-27 20:21:05,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:21:05,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-12-27 20:21:05,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-12-27 20:21:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-12-27 20:21:05,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 1200 transitions. [2019-12-27 20:21:05,013 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 1200 transitions. Word has length 61 [2019-12-27 20:21:05,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:05,014 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 1200 transitions. [2019-12-27 20:21:05,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:21:05,014 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1200 transitions. [2019-12-27 20:21:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 20:21:05,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:05,016 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:05,016 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:05,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:05,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1452023240, now seen corresponding path program 1 times [2019-12-27 20:21:05,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:05,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295023455] [2019-12-27 20:21:05,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:05,115 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 20:21:05,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295023455] [2019-12-27 20:21:05,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:05,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:21:05,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [794144075] [2019-12-27 20:21:05,116 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:05,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:05,289 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 272 transitions. [2019-12-27 20:21:05,290 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:05,416 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:21:05,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:21:05,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:05,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:21:05,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:21:05,418 INFO L87 Difference]: Start difference. First operand 568 states and 1200 transitions. Second operand 11 states. [2019-12-27 20:21:07,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:07,565 INFO L93 Difference]: Finished difference Result 3318 states and 7024 transitions. [2019-12-27 20:21:07,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 20:21:07,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-12-27 20:21:07,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:07,569 INFO L225 Difference]: With dead ends: 3318 [2019-12-27 20:21:07,569 INFO L226 Difference]: Without dead ends: 2174 [2019-12-27 20:21:07,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=302, Invalid=1180, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 20:21:07,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2019-12-27 20:21:07,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 975. [2019-12-27 20:21:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2019-12-27 20:21:07,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 2099 transitions. [2019-12-27 20:21:07,589 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 2099 transitions. Word has length 62 [2019-12-27 20:21:07,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:07,589 INFO L462 AbstractCegarLoop]: Abstraction has 975 states and 2099 transitions. [2019-12-27 20:21:07,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:21:07,590 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 2099 transitions. [2019-12-27 20:21:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 20:21:07,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:07,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:07,592 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:07,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:07,592 INFO L82 PathProgramCache]: Analyzing trace with hash 770256630, now seen corresponding path program 2 times [2019-12-27 20:21:07,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:07,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811628189] [2019-12-27 20:21:07,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:07,915 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 20:21:07,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811628189] [2019-12-27 20:21:07,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:07,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:21:07,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [979007233] [2019-12-27 20:21:07,917 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:07,951 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:08,018 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 131 transitions. [2019-12-27 20:21:08,019 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:08,124 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:21:08,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:21:08,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:08,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:21:08,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:21:08,125 INFO L87 Difference]: Start difference. First operand 975 states and 2099 transitions. Second operand 12 states. [2019-12-27 20:21:10,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:10,125 INFO L93 Difference]: Finished difference Result 3067 states and 6428 transitions. [2019-12-27 20:21:10,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 20:21:10,125 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2019-12-27 20:21:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:10,129 INFO L225 Difference]: With dead ends: 3067 [2019-12-27 20:21:10,129 INFO L226 Difference]: Without dead ends: 3067 [2019-12-27 20:21:10,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-27 20:21:10,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2019-12-27 20:21:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 1703. [2019-12-27 20:21:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-12-27 20:21:10,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 3618 transitions. [2019-12-27 20:21:10,154 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 3618 transitions. Word has length 62 [2019-12-27 20:21:10,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:10,154 INFO L462 AbstractCegarLoop]: Abstraction has 1703 states and 3618 transitions. [2019-12-27 20:21:10,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:21:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 3618 transitions. [2019-12-27 20:21:10,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 20:21:10,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:10,157 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:10,158 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:10,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:10,158 INFO L82 PathProgramCache]: Analyzing trace with hash -507627398, now seen corresponding path program 3 times [2019-12-27 20:21:10,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:10,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432395106] [2019-12-27 20:21:10,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:10,252 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 20:21:10,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432395106] [2019-12-27 20:21:10,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:10,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:21:10,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [165384574] [2019-12-27 20:21:10,253 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:10,270 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:10,357 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 188 transitions. [2019-12-27 20:21:10,357 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:10,358 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:21:10,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:21:10,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:10,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:21:10,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:21:10,359 INFO L87 Difference]: Start difference. First operand 1703 states and 3618 transitions. Second operand 8 states. [2019-12-27 20:21:10,566 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-27 20:21:10,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:10,734 INFO L93 Difference]: Finished difference Result 3914 states and 8237 transitions. [2019-12-27 20:21:10,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 20:21:10,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-27 20:21:10,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:10,739 INFO L225 Difference]: With dead ends: 3914 [2019-12-27 20:21:10,739 INFO L226 Difference]: Without dead ends: 3095 [2019-12-27 20:21:10,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:21:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2019-12-27 20:21:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 1766. [2019-12-27 20:21:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2019-12-27 20:21:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 3797 transitions. [2019-12-27 20:21:10,762 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 3797 transitions. Word has length 62 [2019-12-27 20:21:10,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:10,763 INFO L462 AbstractCegarLoop]: Abstraction has 1766 states and 3797 transitions. [2019-12-27 20:21:10,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:21:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 3797 transitions. [2019-12-27 20:21:10,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 20:21:10,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:10,767 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:10,767 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:10,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:10,767 INFO L82 PathProgramCache]: Analyzing trace with hash 275192136, now seen corresponding path program 4 times [2019-12-27 20:21:10,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:10,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178853019] [2019-12-27 20:21:10,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:10,848 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 20:21:10,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178853019] [2019-12-27 20:21:10,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:10,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:21:10,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [817676226] [2019-12-27 20:21:10,849 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:10,866 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:11,024 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 277 transitions. [2019-12-27 20:21:11,024 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:11,098 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:21:11,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:21:11,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:11,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:21:11,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:21:11,099 INFO L87 Difference]: Start difference. First operand 1766 states and 3797 transitions. Second operand 7 states. [2019-12-27 20:21:11,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:11,812 INFO L93 Difference]: Finished difference Result 3275 states and 6960 transitions. [2019-12-27 20:21:11,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:21:11,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-27 20:21:11,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:11,817 INFO L225 Difference]: With dead ends: 3275 [2019-12-27 20:21:11,817 INFO L226 Difference]: Without dead ends: 3275 [2019-12-27 20:21:11,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:21:11,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2019-12-27 20:21:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 1968. [2019-12-27 20:21:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1968 states. [2019-12-27 20:21:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 4317 transitions. [2019-12-27 20:21:11,846 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 4317 transitions. Word has length 62 [2019-12-27 20:21:11,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:11,846 INFO L462 AbstractCegarLoop]: Abstraction has 1968 states and 4317 transitions. [2019-12-27 20:21:11,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:21:11,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 4317 transitions. [2019-12-27 20:21:11,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 20:21:11,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:11,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:11,851 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:11,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:11,851 INFO L82 PathProgramCache]: Analyzing trace with hash -359705234, now seen corresponding path program 5 times [2019-12-27 20:21:11,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:11,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129536157] [2019-12-27 20:21:11,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:11,923 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 20:21:11,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129536157] [2019-12-27 20:21:11,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:11,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:21:11,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [480440284] [2019-12-27 20:21:11,924 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:11,947 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:12,061 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 157 transitions. [2019-12-27 20:21:12,062 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:12,062 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:21:12,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:21:12,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:12,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:21:12,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:21:12,063 INFO L87 Difference]: Start difference. First operand 1968 states and 4317 transitions. Second operand 3 states. [2019-12-27 20:21:12,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:12,085 INFO L93 Difference]: Finished difference Result 1967 states and 4315 transitions. [2019-12-27 20:21:12,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:21:12,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-27 20:21:12,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:12,088 INFO L225 Difference]: With dead ends: 1967 [2019-12-27 20:21:12,089 INFO L226 Difference]: Without dead ends: 1967 [2019-12-27 20:21:12,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:21:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2019-12-27 20:21:12,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1840. [2019-12-27 20:21:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1840 states. [2019-12-27 20:21:12,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 4078 transitions. [2019-12-27 20:21:12,116 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 4078 transitions. Word has length 62 [2019-12-27 20:21:12,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:12,117 INFO L462 AbstractCegarLoop]: Abstraction has 1840 states and 4078 transitions. [2019-12-27 20:21:12,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:21:12,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 4078 transitions. [2019-12-27 20:21:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 20:21:12,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:12,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:12,121 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:12,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:12,121 INFO L82 PathProgramCache]: Analyzing trace with hash -770635468, now seen corresponding path program 1 times [2019-12-27 20:21:12,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:12,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452801745] [2019-12-27 20:21:12,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:21:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:21:12,348 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:21:12,349 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:21:12,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1012] [1012] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~main$tmp_guard0~0_10 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t518~0.base_24|) 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t518~0.base_24|) (= 0 v_~__unbuffered_p1_EAX~0_12) (= v_~z~0_11 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd0~0_18) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t518~0.base_24| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t518~0.base_24|) |v_ULTIMATE.start_main_~#t518~0.offset_17| 0)) |v_#memory_int_15|) (= 0 v_~y$r_buff1_thd3~0_40) (= 0 v_~y$read_delayed_var~0.base_5) (= v_~y$w_buff1_used~0_70 0) (= v_~x~0_15 0) (= v_~y$r_buff0_thd1~0_9 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~y$w_buff1~0_31) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t518~0.base_24| 4)) (= v_~y~0_29 0) (= v_~y$r_buff1_thd1~0_9 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= 0 v_~__unbuffered_cnt~0_23) (= v_~y$r_buff0_thd3~0_76 0) (= v_~y$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_p2_EAX~0_11) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= |v_ULTIMATE.start_main_~#t518~0.offset_17| 0) (= v_~y$mem_tmp~0_12 0) (= v_~__unbuffered_p2_EBX~0_11 0) (= v_~y$r_buff0_thd2~0_48 0) (= 0 v_~y$r_buff1_thd2~0_30) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t518~0.base_24| 1)) (= v_~main$tmp_guard1~0_12 0) (= v_~y$w_buff0_used~0_127 0) (= 0 v_~y$w_buff0~0_35) (= 0 v_~y$flush_delayed~0_17) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t518~0.base=|v_ULTIMATE.start_main_~#t518~0.base_24|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_17, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ULTIMATE.start_main_~#t519~0.offset=|v_ULTIMATE.start_main_~#t519~0.offset_17|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_11, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_11|, ULTIMATE.start_main_~#t520~0.offset=|v_ULTIMATE.start_main_~#t520~0.offset_17|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_15|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_9|, ~y$w_buff1~0=v_~y$w_buff1~0_31, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_48, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_18, ~x~0=v_~x~0_15, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ULTIMATE.start_main_~#t518~0.offset=|v_ULTIMATE.start_main_~#t518~0.offset_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_~#t520~0.base=|v_ULTIMATE.start_main_~#t520~0.base_23|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_76, ~y~0=v_~y~0_29, ULTIMATE.start_main_~#t519~0.base=|v_ULTIMATE.start_main_~#t519~0.base_23|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_9|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_30, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_9|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_15|, ~z~0=v_~z~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_70} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ULTIMATE.start_main_~#t518~0.base, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t519~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t520~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t518~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t520~0.base, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t519~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:21:12,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L828-1-->L830: Formula: (and (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t519~0.base_12|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t519~0.base_12|) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t519~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t519~0.base_12|) |v_ULTIMATE.start_main_~#t519~0.offset_10| 1)) |v_#memory_int_7|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t519~0.base_12| 1) |v_#valid_34|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t519~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t519~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t519~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t519~0.base=|v_ULTIMATE.start_main_~#t519~0.base_12|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_~#t519~0.offset=|v_ULTIMATE.start_main_~#t519~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t519~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t519~0.offset] because there is no mapped edge [2019-12-27 20:21:12,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L830-1-->L832: Formula: (and (not (= |v_ULTIMATE.start_main_~#t520~0.base_13| 0)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t520~0.base_13| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t520~0.base_13|) (= |v_ULTIMATE.start_main_~#t520~0.offset_11| 0) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t520~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t520~0.base_13| 4) |v_#length_17|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t520~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t520~0.base_13|) |v_ULTIMATE.start_main_~#t520~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t520~0.offset=|v_ULTIMATE.start_main_~#t520~0.offset_11|, ULTIMATE.start_main_~#t520~0.base=|v_ULTIMATE.start_main_~#t520~0.base_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t520~0.offset, ULTIMATE.start_main_~#t520~0.base] because there is no mapped edge [2019-12-27 20:21:12,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] P2ENTRY-->L4-3: Formula: (and (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_7) (= 1 v_~y$w_buff0~0_20) (= v_~y$w_buff0~0_21 v_~y$w_buff1~0_18) (= (mod v_~y$w_buff1_used~0_50 256) 0) (= 1 |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|) (= v_~y$w_buff1_used~0_50 v_~y$w_buff0_used~0_89) (= v_P2Thread1of1ForFork2_~arg.base_5 |v_P2Thread1of1ForFork2_#in~arg.base_5|) (= |v_P2Thread1of1ForFork2_#in~arg.offset_5| v_P2Thread1of1ForFork2_~arg.offset_5) (= 1 v_~y$w_buff0_used~0_88)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_21, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_18, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_5, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_5, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|, ~y$w_buff0~0=v_~y$w_buff0~0_20, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_7, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_50} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:21:12,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L790-2-->L790-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1310316226 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1310316226 256))) (.cse2 (= |P2Thread1of1ForFork2_#t~ite29_Out-1310316226| |P2Thread1of1ForFork2_#t~ite28_Out-1310316226|))) (or (and (not .cse0) (not .cse1) .cse2 (= ~y$w_buff0~0_In-1310316226 |P2Thread1of1ForFork2_#t~ite28_Out-1310316226|)) (and (= ~y$w_buff1~0_In-1310316226 |P2Thread1of1ForFork2_#t~ite28_Out-1310316226|) (or .cse1 .cse0) .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1310316226, ~y$w_buff1~0=~y$w_buff1~0_In-1310316226, ~y$w_buff0~0=~y$w_buff0~0_In-1310316226, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1310316226} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1310316226, ~y$w_buff1~0=~y$w_buff1~0_In-1310316226, ~y$w_buff0~0=~y$w_buff0~0_In-1310316226, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1310316226, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-1310316226|, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1310316226|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 20:21:12,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L795-->L796: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_29 256))) (= v_~y$r_buff0_thd3~0_62 v_~y$r_buff0_thd3~0_61)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P2Thread1of1ForFork2_#t~ite42=|v_P2Thread1of1ForFork2_#t~ite42_8|, P2Thread1of1ForFork2_#t~ite44=|v_P2Thread1of1ForFork2_#t~ite44_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_61, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42, P2Thread1of1ForFork2_#t~ite44, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 20:21:12,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1980743466 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-1980743466 |P2Thread1of1ForFork2_#t~ite48_Out-1980743466|)) (and (= ~y~0_In-1980743466 |P2Thread1of1ForFork2_#t~ite48_Out-1980743466|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1980743466, ~y$flush_delayed~0=~y$flush_delayed~0_In-1980743466, ~y~0=~y~0_In-1980743466} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1980743466, P2Thread1of1ForFork2_#t~ite48=|P2Thread1of1ForFork2_#t~ite48_Out-1980743466|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1980743466, ~y~0=~y~0_In-1980743466} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-27 20:21:12,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= 1 v_~z~0_7)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~z~0=v_~z~0_7, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_9, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 20:21:12,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-780573840 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-780573840 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite51_Out-780573840|)) (and (= ~y$w_buff0_used~0_In-780573840 |P2Thread1of1ForFork2_#t~ite51_Out-780573840|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-780573840, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-780573840} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-780573840, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-780573840, P2Thread1of1ForFork2_#t~ite51=|P2Thread1of1ForFork2_#t~ite51_Out-780573840|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-27 20:21:12,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L807-->L807-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-1350696921 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1350696921 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1350696921 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1350696921 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1350696921 |P2Thread1of1ForFork2_#t~ite52_Out-1350696921|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite52_Out-1350696921| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1350696921, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1350696921, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1350696921, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1350696921} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1350696921, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1350696921, P2Thread1of1ForFork2_#t~ite52=|P2Thread1of1ForFork2_#t~ite52_Out-1350696921|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1350696921, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1350696921} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-27 20:21:12,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L808-->L809: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-208404880 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-208404880 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out-208404880 ~y$r_buff0_thd3~0_In-208404880) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd3~0_Out-208404880 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-208404880, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-208404880} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-208404880, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-208404880, P2Thread1of1ForFork2_#t~ite53=|P2Thread1of1ForFork2_#t~ite53_Out-208404880|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite53] because there is no mapped edge [2019-12-27 20:21:12,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In1638960909 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1638960909 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1638960909 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1638960909 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite54_Out1638960909|)) (and (= ~y$r_buff1_thd3~0_In1638960909 |P2Thread1of1ForFork2_#t~ite54_Out1638960909|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1638960909, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1638960909, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1638960909, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1638960909} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1638960909, P2Thread1of1ForFork2_#t~ite54=|P2Thread1of1ForFork2_#t~ite54_Out1638960909|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1638960909, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1638960909, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1638960909} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-27 20:21:12,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L809-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite54_8| v_~y$r_buff1_thd3~0_34) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite54=|v_P2Thread1of1ForFork2_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_34, P2Thread1of1ForFork2_#t~ite54=|v_P2Thread1of1ForFork2_#t~ite54_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite54, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 20:21:12,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1926454747 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite25_Out1926454747| ~y$mem_tmp~0_In1926454747)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite25_Out1926454747| ~y~0_In1926454747)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1926454747, ~y$flush_delayed~0=~y$flush_delayed~0_In1926454747, ~y~0=~y~0_In1926454747} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1926454747, ~y$flush_delayed~0=~y$flush_delayed~0_In1926454747, ~y~0=~y~0_In1926454747, P1Thread1of1ForFork1_#t~ite25=|P1Thread1of1ForFork1_#t~ite25_Out1926454747|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 20:21:12,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [990] [990] L761-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y~0_25 |v_P1Thread1of1ForFork1_#t~ite25_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= 0 v_~y$flush_delayed~0_13) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~y~0=v_~y~0_25, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 20:21:12,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L832-1-->L838: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= 3 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:21:12,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L838-2-->L838-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In708735093 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In708735093 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In708735093 |ULTIMATE.start_main_#t~ite58_Out708735093|) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In708735093 |ULTIMATE.start_main_#t~ite58_Out708735093|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In708735093, ~y~0=~y~0_In708735093, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In708735093, ~y$w_buff1_used~0=~y$w_buff1_used~0_In708735093} OutVars{~y$w_buff1~0=~y$w_buff1~0_In708735093, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out708735093|, ~y~0=~y~0_In708735093, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In708735093, ~y$w_buff1_used~0=~y$w_buff1_used~0_In708735093} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58] because there is no mapped edge [2019-12-27 20:21:12,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L838-4-->L839: Formula: (= v_~y~0_19 |v_ULTIMATE.start_main_#t~ite58_8|) InVars {ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_8|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_7|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~y~0=v_~y~0_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59, ~y~0] because there is no mapped edge [2019-12-27 20:21:12,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L839-->L839-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1803033502 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1803033502 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out1803033502| ~y$w_buff0_used~0_In1803033502) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite60_Out1803033502| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1803033502, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1803033502} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1803033502|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1803033502, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1803033502} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 20:21:12,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L840-->L840-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1291545452 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1291545452 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1291545452 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1291545452 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite61_Out1291545452| ~y$w_buff1_used~0_In1291545452)) (and (= |ULTIMATE.start_main_#t~ite61_Out1291545452| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1291545452, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1291545452, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1291545452, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1291545452} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1291545452|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1291545452, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1291545452, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1291545452, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1291545452} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 20:21:12,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-402846539 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-402846539 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-402846539 |ULTIMATE.start_main_#t~ite62_Out-402846539|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite62_Out-402846539|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-402846539, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-402846539} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-402846539|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-402846539, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-402846539} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 20:21:12,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L842-->L842-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In1095863843 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1095863843 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1095863843 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1095863843 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out1095863843|)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite63_Out1095863843| ~y$r_buff1_thd0~0_In1095863843) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1095863843, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1095863843, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1095863843, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1095863843} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1095863843|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1095863843, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1095863843, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1095863843, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1095863843} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 20:21:12,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L842-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_8 0) (= 0 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p2_EAX~0_7 1) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_8 256)) (= |v_ULTIMATE.start_main_#t~ite63_11| v_~y$r_buff1_thd0~0_14) (= v_~x~0_11 2) (= v_~__unbuffered_p2_EBX~0_7 0)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:21:12,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:21:12 BasicIcfg [2019-12-27 20:21:12,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:21:12,649 INFO L168 Benchmark]: Toolchain (without parser) took 32680.66 ms. Allocated memory was 146.3 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 103.0 MB in the beginning and 1.0 GB in the end (delta: -931.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 20:21:12,650 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 20:21:12,651 INFO L168 Benchmark]: CACSL2BoogieTranslator took 722.33 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.8 MB in the beginning and 157.2 MB in the end (delta: -54.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:21:12,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.55 ms. Allocated memory is still 204.5 MB. Free memory was 157.2 MB in the beginning and 153.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 20:21:12,652 INFO L168 Benchmark]: Boogie Preprocessor took 40.15 ms. Allocated memory is still 204.5 MB. Free memory was 153.9 MB in the beginning and 152.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:21:12,653 INFO L168 Benchmark]: RCFGBuilder took 1138.46 ms. Allocated memory is still 204.5 MB. Free memory was 151.3 MB in the beginning and 96.5 MB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:21:12,654 INFO L168 Benchmark]: TraceAbstraction took 30702.25 ms. Allocated memory was 204.5 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 96.5 MB in the beginning and 1.0 GB in the end (delta: -938.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 20:21:12,663 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.24 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 722.33 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.8 MB in the beginning and 157.2 MB in the end (delta: -54.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.55 ms. Allocated memory is still 204.5 MB. Free memory was 157.2 MB in the beginning and 153.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.15 ms. Allocated memory is still 204.5 MB. Free memory was 153.9 MB in the beginning and 152.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1138.46 ms. Allocated memory is still 204.5 MB. Free memory was 151.3 MB in the beginning and 96.5 MB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30702.25 ms. Allocated memory was 204.5 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 96.5 MB in the beginning and 1.0 GB in the end (delta: -938.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 194 ProgramPointsBefore, 112 ProgramPointsAfterwards, 240 TransitionsBefore, 134 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 28 ChoiceCompositions, 8893 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 133002 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L828] FCALL, FORK 0 pthread_create(&t518, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t519, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t520, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 y$flush_delayed = weak$$choice2 [L789] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=0, y=0, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=0, y=0, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L791] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=0, y=1, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L792] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=0, y=1, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L793] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=0, y=1, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L794] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=0, y=1, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=0, y=1, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=0, y=1, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y = y$flush_delayed ? y$mem_tmp : y [L799] 3 y$flush_delayed = (_Bool)0 [L802] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 2 x = 2 [L749] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 2 y$flush_delayed = weak$$choice2 [L752] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L754] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L755] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L756] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L759] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L760] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 30.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2344 SDtfs, 5320 SDslu, 5920 SDs, 0 SdLazy, 3724 SolverSat, 470 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52598occurred 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: 7.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 7262 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 637 NumberOfCodeBlocks, 637 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 561 ConstructedInterpolants, 0 QuantifiedInterpolants, 90958 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...