/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:36:00,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:36:00,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:36:00,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:36:00,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:36:00,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:36:00,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:36:00,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:36:00,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:36:00,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:36:00,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:36:00,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:36:00,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:36:00,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:36:00,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:36:00,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:36:00,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:36:00,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:36:00,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:36:00,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:36:00,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:36:00,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:36:00,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:36:00,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:36:00,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:36:00,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:36:00,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:36:00,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:36:00,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:36:00,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:36:00,751 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:36:00,751 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:36:00,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:36:00,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:36:00,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:36:00,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:36:00,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:36:00,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:36:00,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:36:00,756 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:36:00,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:36:00,757 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:36:00,778 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:36:00,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:36:00,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:36:00,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:36:00,781 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:36:00,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:36:00,781 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:36:00,781 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:36:00,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:36:00,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:36:00,784 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:36:00,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:36:00,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:36:00,785 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:36:00,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:36:00,785 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:36:00,785 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:36:00,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:36:00,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:36:00,786 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:36:00,786 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:36:00,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:36:00,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:36:00,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:36:00,787 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:36:00,787 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:36:00,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:36:00,788 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:36:00,788 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:36:00,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:36:01,041 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:36:01,055 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:36:01,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:36:01,061 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:36:01,061 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:36:01,062 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i [2019-12-18 14:36:01,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29cc08fc/78861879dbf24da389a9b84f5f5a4fe2/FLAGc5d45e5b8 [2019-12-18 14:36:01,736 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:36:01,737 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i [2019-12-18 14:36:01,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29cc08fc/78861879dbf24da389a9b84f5f5a4fe2/FLAGc5d45e5b8 [2019-12-18 14:36:01,992 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29cc08fc/78861879dbf24da389a9b84f5f5a4fe2 [2019-12-18 14:36:02,001 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:36:02,003 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:36:02,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:36:02,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:36:02,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:36:02,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:36:01" (1/1) ... [2019-12-18 14:36:02,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56133e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:02, skipping insertion in model container [2019-12-18 14:36:02,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:36:01" (1/1) ... [2019-12-18 14:36:02,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:36:02,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:36:02,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:36:02,627 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:36:02,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:36:02,836 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:36:02,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:02 WrapperNode [2019-12-18 14:36:02,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:36:02,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:36:02,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:36:02,837 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:36:02,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:02" (1/1) ... [2019-12-18 14:36:02,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:02" (1/1) ... [2019-12-18 14:36:02,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:36:02,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:36:02,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:36:02,931 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:36:02,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:02" (1/1) ... [2019-12-18 14:36:02,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:02" (1/1) ... [2019-12-18 14:36:02,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:02" (1/1) ... [2019-12-18 14:36:02,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:02" (1/1) ... [2019-12-18 14:36:02,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:02" (1/1) ... [2019-12-18 14:36:02,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:02" (1/1) ... [2019-12-18 14:36:03,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:02" (1/1) ... [2019-12-18 14:36:03,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:36:03,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:36:03,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:36:03,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:36:03,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:36:03,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 14:36:03,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:36:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:36:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:36:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:36:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:36:03,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:36:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:36:03,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:36:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:36:03,088 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:36:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-18 14:36:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:36:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:36:03,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:36:03,091 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:36:03,898 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:36:03,899 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-18 14:36:03,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:36:03 BoogieIcfgContainer [2019-12-18 14:36:03,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:36:03,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:36:03,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:36:03,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:36:03,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:36:01" (1/3) ... [2019-12-18 14:36:03,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e91487d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:36:03, skipping insertion in model container [2019-12-18 14:36:03,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:02" (2/3) ... [2019-12-18 14:36:03,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e91487d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:36:03, skipping insertion in model container [2019-12-18 14:36:03,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:36:03" (3/3) ... [2019-12-18 14:36:03,912 INFO L109 eAbstractionObserver]: Analyzing ICFG safe009_rmo.opt.i [2019-12-18 14:36:03,923 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:36:03,923 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:36:03,940 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-18 14:36:03,941 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:36:04,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,011 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,011 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,019 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,020 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,044 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,045 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,057 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,060 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,064 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,064 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,068 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,069 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:04,084 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-18 14:36:04,104 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:36:04,105 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:36:04,105 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:36:04,105 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:36:04,105 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:36:04,105 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:36:04,105 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:36:04,105 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:36:04,123 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 230 transitions [2019-12-18 14:36:04,125 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 192 places, 230 transitions [2019-12-18 14:36:04,224 INFO L126 PetriNetUnfolder]: 48/227 cut-off events. [2019-12-18 14:36:04,225 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:36:04,245 INFO L76 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 227 events. 48/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 453 event pairs. 9/187 useless extension candidates. Maximal degree in co-relation 180. Up to 2 conditions per place. [2019-12-18 14:36:04,275 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 192 places, 230 transitions [2019-12-18 14:36:04,327 INFO L126 PetriNetUnfolder]: 48/227 cut-off events. [2019-12-18 14:36:04,327 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:36:04,339 INFO L76 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 227 events. 48/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 453 event pairs. 9/187 useless extension candidates. Maximal degree in co-relation 180. Up to 2 conditions per place. [2019-12-18 14:36:04,362 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19530 [2019-12-18 14:36:04,363 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:36:10,349 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-12-18 14:36:10,568 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-12-18 14:36:11,095 WARN L192 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 130 [2019-12-18 14:36:11,332 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-12-18 14:36:11,355 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80972 [2019-12-18 14:36:11,355 INFO L214 etLargeBlockEncoding]: Total number of compositions: 145 [2019-12-18 14:36:11,359 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 95 transitions [2019-12-18 14:36:22,330 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 88334 states. [2019-12-18 14:36:22,332 INFO L276 IsEmpty]: Start isEmpty. Operand 88334 states. [2019-12-18 14:36:22,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 14:36:22,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:22,389 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:36:22,389 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:22,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:22,396 INFO L82 PathProgramCache]: Analyzing trace with hash -986847660, now seen corresponding path program 1 times [2019-12-18 14:36:22,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:22,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209642872] [2019-12-18 14:36:22,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:22,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:22,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209642872] [2019-12-18 14:36:22,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:22,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:36:22,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477512240] [2019-12-18 14:36:22,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:36:22,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:22,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:36:22,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:36:22,841 INFO L87 Difference]: Start difference. First operand 88334 states. Second operand 4 states. [2019-12-18 14:36:23,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:23,349 INFO L93 Difference]: Finished difference Result 25898 states and 91834 transitions. [2019-12-18 14:36:23,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:36:23,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 14:36:23,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:23,541 INFO L225 Difference]: With dead ends: 25898 [2019-12-18 14:36:23,541 INFO L226 Difference]: Without dead ends: 19826 [2019-12-18 14:36:23,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:36:25,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19826 states. [2019-12-18 14:36:25,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19826 to 19826. [2019-12-18 14:36:25,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19826 states. [2019-12-18 14:36:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19826 states to 19826 states and 67538 transitions. [2019-12-18 14:36:25,746 INFO L78 Accepts]: Start accepts. Automaton has 19826 states and 67538 transitions. Word has length 17 [2019-12-18 14:36:25,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:25,747 INFO L462 AbstractCegarLoop]: Abstraction has 19826 states and 67538 transitions. [2019-12-18 14:36:25,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:36:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 19826 states and 67538 transitions. [2019-12-18 14:36:25,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:36:25,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:25,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:36:25,774 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:25,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:25,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1303435509, now seen corresponding path program 1 times [2019-12-18 14:36:25,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:25,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992746230] [2019-12-18 14:36:25,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:26,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:26,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992746230] [2019-12-18 14:36:26,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:26,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:36:26,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947031064] [2019-12-18 14:36:26,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:36:26,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:26,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:36:26,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:36:26,037 INFO L87 Difference]: Start difference. First operand 19826 states and 67538 transitions. Second operand 5 states. [2019-12-18 14:36:27,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:27,026 INFO L93 Difference]: Finished difference Result 31280 states and 102542 transitions. [2019-12-18 14:36:27,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:36:27,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 14:36:27,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:27,142 INFO L225 Difference]: With dead ends: 31280 [2019-12-18 14:36:27,142 INFO L226 Difference]: Without dead ends: 31280 [2019-12-18 14:36:27,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:36:27,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31280 states. [2019-12-18 14:36:28,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31280 to 27130. [2019-12-18 14:36:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27130 states. [2019-12-18 14:36:28,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27130 states to 27130 states and 90178 transitions. [2019-12-18 14:36:28,397 INFO L78 Accepts]: Start accepts. Automaton has 27130 states and 90178 transitions. Word has length 27 [2019-12-18 14:36:28,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:28,397 INFO L462 AbstractCegarLoop]: Abstraction has 27130 states and 90178 transitions. [2019-12-18 14:36:28,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:36:28,398 INFO L276 IsEmpty]: Start isEmpty. Operand 27130 states and 90178 transitions. [2019-12-18 14:36:28,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 14:36:28,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:28,424 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:36:28,426 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:28,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:28,427 INFO L82 PathProgramCache]: Analyzing trace with hash 457198623, now seen corresponding path program 1 times [2019-12-18 14:36:28,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:28,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651010394] [2019-12-18 14:36:28,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:28,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:28,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651010394] [2019-12-18 14:36:28,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:28,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:36:28,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037249142] [2019-12-18 14:36:28,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:36:28,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:28,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:36:28,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:36:28,583 INFO L87 Difference]: Start difference. First operand 27130 states and 90178 transitions. Second operand 4 states. [2019-12-18 14:36:29,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:29,018 INFO L93 Difference]: Finished difference Result 34594 states and 112479 transitions. [2019-12-18 14:36:29,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:36:29,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 14:36:29,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:29,157 INFO L225 Difference]: With dead ends: 34594 [2019-12-18 14:36:29,157 INFO L226 Difference]: Without dead ends: 34594 [2019-12-18 14:36:29,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:36:29,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34594 states. [2019-12-18 14:36:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34594 to 29785. [2019-12-18 14:36:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29785 states. [2019-12-18 14:36:30,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29785 states to 29785 states and 98293 transitions. [2019-12-18 14:36:30,524 INFO L78 Accepts]: Start accepts. Automaton has 29785 states and 98293 transitions. Word has length 28 [2019-12-18 14:36:30,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:30,524 INFO L462 AbstractCegarLoop]: Abstraction has 29785 states and 98293 transitions. [2019-12-18 14:36:30,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:36:30,525 INFO L276 IsEmpty]: Start isEmpty. Operand 29785 states and 98293 transitions. [2019-12-18 14:36:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 14:36:30,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:30,553 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] [2019-12-18 14:36:30,553 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:30,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:30,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2110520713, now seen corresponding path program 1 times [2019-12-18 14:36:30,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:30,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784270615] [2019-12-18 14:36:30,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:30,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784270615] [2019-12-18 14:36:30,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:30,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:36:30,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103699829] [2019-12-18 14:36:30,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:36:30,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:30,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:36:30,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:36:30,745 INFO L87 Difference]: Start difference. First operand 29785 states and 98293 transitions. Second operand 5 states. [2019-12-18 14:36:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:30,860 INFO L93 Difference]: Finished difference Result 12780 states and 38897 transitions. [2019-12-18 14:36:30,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:36:30,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 14:36:30,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:30,886 INFO L225 Difference]: With dead ends: 12780 [2019-12-18 14:36:30,886 INFO L226 Difference]: Without dead ends: 11007 [2019-12-18 14:36:30,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:36:30,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11007 states. [2019-12-18 14:36:31,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11007 to 10743. [2019-12-18 14:36:31,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10743 states. [2019-12-18 14:36:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10743 states to 10743 states and 32642 transitions. [2019-12-18 14:36:31,154 INFO L78 Accepts]: Start accepts. Automaton has 10743 states and 32642 transitions. Word has length 29 [2019-12-18 14:36:31,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:31,155 INFO L462 AbstractCegarLoop]: Abstraction has 10743 states and 32642 transitions. [2019-12-18 14:36:31,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:36:31,155 INFO L276 IsEmpty]: Start isEmpty. Operand 10743 states and 32642 transitions. [2019-12-18 14:36:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 14:36:31,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:31,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:36:31,185 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:31,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:31,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1416589173, now seen corresponding path program 1 times [2019-12-18 14:36:31,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:31,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235101742] [2019-12-18 14:36:31,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:31,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235101742] [2019-12-18 14:36:31,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:31,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:36:31,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562302739] [2019-12-18 14:36:31,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:36:31,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:31,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:36:31,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:36:31,388 INFO L87 Difference]: Start difference. First operand 10743 states and 32642 transitions. Second operand 7 states. [2019-12-18 14:36:32,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:32,026 INFO L93 Difference]: Finished difference Result 14900 states and 44293 transitions. [2019-12-18 14:36:32,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:36:32,027 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-18 14:36:32,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:32,048 INFO L225 Difference]: With dead ends: 14900 [2019-12-18 14:36:32,048 INFO L226 Difference]: Without dead ends: 14900 [2019-12-18 14:36:32,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:36:33,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14900 states. [2019-12-18 14:36:33,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14900 to 11341. [2019-12-18 14:36:33,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11341 states. [2019-12-18 14:36:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11341 states to 11341 states and 34393 transitions. [2019-12-18 14:36:33,550 INFO L78 Accepts]: Start accepts. Automaton has 11341 states and 34393 transitions. Word has length 39 [2019-12-18 14:36:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:33,550 INFO L462 AbstractCegarLoop]: Abstraction has 11341 states and 34393 transitions. [2019-12-18 14:36:33,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:36:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 11341 states and 34393 transitions. [2019-12-18 14:36:33,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:36:33,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:33,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:36:33,576 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:33,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:33,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1670978222, now seen corresponding path program 1 times [2019-12-18 14:36:33,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:33,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633986462] [2019-12-18 14:36:33,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:33,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633986462] [2019-12-18 14:36:33,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:33,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:36:33,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398078063] [2019-12-18 14:36:33,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:36:33,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:33,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:36:33,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:36:33,672 INFO L87 Difference]: Start difference. First operand 11341 states and 34393 transitions. Second operand 6 states. [2019-12-18 14:36:33,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:33,766 INFO L93 Difference]: Finished difference Result 10537 states and 32450 transitions. [2019-12-18 14:36:33,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:36:33,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 14:36:33,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:33,781 INFO L225 Difference]: With dead ends: 10537 [2019-12-18 14:36:33,782 INFO L226 Difference]: Without dead ends: 10428 [2019-12-18 14:36:33,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:36:33,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10428 states. [2019-12-18 14:36:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10428 to 9924. [2019-12-18 14:36:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9924 states. [2019-12-18 14:36:34,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9924 states to 9924 states and 30879 transitions. [2019-12-18 14:36:34,029 INFO L78 Accepts]: Start accepts. Automaton has 9924 states and 30879 transitions. Word has length 40 [2019-12-18 14:36:34,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:34,031 INFO L462 AbstractCegarLoop]: Abstraction has 9924 states and 30879 transitions. [2019-12-18 14:36:34,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:36:34,032 INFO L276 IsEmpty]: Start isEmpty. Operand 9924 states and 30879 transitions. [2019-12-18 14:36:34,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 14:36:34,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:34,053 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] [2019-12-18 14:36:34,053 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:34,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:34,054 INFO L82 PathProgramCache]: Analyzing trace with hash 227924408, now seen corresponding path program 1 times [2019-12-18 14:36:34,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:34,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234755233] [2019-12-18 14:36:34,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:34,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234755233] [2019-12-18 14:36:34,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:34,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:36:34,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211039096] [2019-12-18 14:36:34,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:36:34,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:34,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:36:34,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:34,113 INFO L87 Difference]: Start difference. First operand 9924 states and 30879 transitions. Second operand 3 states. [2019-12-18 14:36:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:34,206 INFO L93 Difference]: Finished difference Result 16476 states and 50334 transitions. [2019-12-18 14:36:34,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:36:34,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 14:36:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:34,235 INFO L225 Difference]: With dead ends: 16476 [2019-12-18 14:36:34,235 INFO L226 Difference]: Without dead ends: 16476 [2019-12-18 14:36:34,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:34,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16476 states. [2019-12-18 14:36:34,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16476 to 11562. [2019-12-18 14:36:34,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11562 states. [2019-12-18 14:36:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11562 states to 11562 states and 35633 transitions. [2019-12-18 14:36:34,522 INFO L78 Accepts]: Start accepts. Automaton has 11562 states and 35633 transitions. Word has length 58 [2019-12-18 14:36:34,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:34,523 INFO L462 AbstractCegarLoop]: Abstraction has 11562 states and 35633 transitions. [2019-12-18 14:36:34,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:36:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 11562 states and 35633 transitions. [2019-12-18 14:36:34,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 14:36:34,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:34,541 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] [2019-12-18 14:36:34,542 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:34,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:34,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1697581937, now seen corresponding path program 1 times [2019-12-18 14:36:34,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:34,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178118426] [2019-12-18 14:36:34,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:34,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178118426] [2019-12-18 14:36:34,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:34,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:36:34,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029456865] [2019-12-18 14:36:34,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:36:34,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:34,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:36:34,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:36:34,619 INFO L87 Difference]: Start difference. First operand 11562 states and 35633 transitions. Second operand 5 states. [2019-12-18 14:36:34,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:34,883 INFO L93 Difference]: Finished difference Result 13503 states and 40608 transitions. [2019-12-18 14:36:34,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:36:34,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 14:36:34,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:34,903 INFO L225 Difference]: With dead ends: 13503 [2019-12-18 14:36:34,903 INFO L226 Difference]: Without dead ends: 13503 [2019-12-18 14:36:34,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:36:34,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13503 states. [2019-12-18 14:36:35,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13503 to 11034. [2019-12-18 14:36:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11034 states. [2019-12-18 14:36:35,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11034 states to 11034 states and 33302 transitions. [2019-12-18 14:36:35,227 INFO L78 Accepts]: Start accepts. Automaton has 11034 states and 33302 transitions. Word has length 58 [2019-12-18 14:36:35,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:35,227 INFO L462 AbstractCegarLoop]: Abstraction has 11034 states and 33302 transitions. [2019-12-18 14:36:35,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:36:35,227 INFO L276 IsEmpty]: Start isEmpty. Operand 11034 states and 33302 transitions. [2019-12-18 14:36:35,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 14:36:35,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:35,239 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] [2019-12-18 14:36:35,240 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:35,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:35,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2115982021, now seen corresponding path program 1 times [2019-12-18 14:36:35,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:35,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918789070] [2019-12-18 14:36:35,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:35,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918789070] [2019-12-18 14:36:35,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:35,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:36:35,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820552395] [2019-12-18 14:36:35,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:36:35,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:35,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:36:35,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:36:35,325 INFO L87 Difference]: Start difference. First operand 11034 states and 33302 transitions. Second operand 4 states. [2019-12-18 14:36:35,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:35,426 INFO L93 Difference]: Finished difference Result 15781 states and 46934 transitions. [2019-12-18 14:36:35,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:36:35,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-18 14:36:35,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:35,446 INFO L225 Difference]: With dead ends: 15781 [2019-12-18 14:36:35,446 INFO L226 Difference]: Without dead ends: 15781 [2019-12-18 14:36:35,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:36:35,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15781 states. [2019-12-18 14:36:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15781 to 10050. [2019-12-18 14:36:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10050 states. [2019-12-18 14:36:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10050 states to 10050 states and 30316 transitions. [2019-12-18 14:36:35,631 INFO L78 Accepts]: Start accepts. Automaton has 10050 states and 30316 transitions. Word has length 59 [2019-12-18 14:36:35,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:35,631 INFO L462 AbstractCegarLoop]: Abstraction has 10050 states and 30316 transitions. [2019-12-18 14:36:35,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:36:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 10050 states and 30316 transitions. [2019-12-18 14:36:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 14:36:35,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:35,643 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] [2019-12-18 14:36:35,643 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:35,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:35,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1574340111, now seen corresponding path program 1 times [2019-12-18 14:36:35,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:35,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659577066] [2019-12-18 14:36:35,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:35,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659577066] [2019-12-18 14:36:35,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:35,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:36:35,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172403249] [2019-12-18 14:36:35,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:36:35,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:35,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:36:35,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:35,718 INFO L87 Difference]: Start difference. First operand 10050 states and 30316 transitions. Second operand 3 states. [2019-12-18 14:36:35,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:35,764 INFO L93 Difference]: Finished difference Result 10049 states and 30314 transitions. [2019-12-18 14:36:35,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:36:35,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 14:36:35,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:35,781 INFO L225 Difference]: With dead ends: 10049 [2019-12-18 14:36:35,781 INFO L226 Difference]: Without dead ends: 10049 [2019-12-18 14:36:35,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:35,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10049 states. [2019-12-18 14:36:35,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10049 to 10049. [2019-12-18 14:36:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10049 states. [2019-12-18 14:36:36,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10049 states to 10049 states and 30314 transitions. [2019-12-18 14:36:36,017 INFO L78 Accepts]: Start accepts. Automaton has 10049 states and 30314 transitions. Word has length 59 [2019-12-18 14:36:36,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:36,017 INFO L462 AbstractCegarLoop]: Abstraction has 10049 states and 30314 transitions. [2019-12-18 14:36:36,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:36:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 10049 states and 30314 transitions. [2019-12-18 14:36:36,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 14:36:36,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:36,035 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] [2019-12-18 14:36:36,035 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:36,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:36,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1561527340, now seen corresponding path program 1 times [2019-12-18 14:36:36,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:36,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319430743] [2019-12-18 14:36:36,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:36,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319430743] [2019-12-18 14:36:36,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:36,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:36:36,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118562579] [2019-12-18 14:36:36,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:36:36,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:36,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:36:36,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:36:36,162 INFO L87 Difference]: Start difference. First operand 10049 states and 30314 transitions. Second operand 6 states. [2019-12-18 14:36:36,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:36,897 INFO L93 Difference]: Finished difference Result 12983 states and 38588 transitions. [2019-12-18 14:36:36,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:36:36,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 14:36:36,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:36,915 INFO L225 Difference]: With dead ends: 12983 [2019-12-18 14:36:36,916 INFO L226 Difference]: Without dead ends: 12983 [2019-12-18 14:36:36,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:36:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12983 states. [2019-12-18 14:36:37,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12983 to 10145. [2019-12-18 14:36:37,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10145 states. [2019-12-18 14:36:37,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10145 states to 10145 states and 30616 transitions. [2019-12-18 14:36:37,093 INFO L78 Accepts]: Start accepts. Automaton has 10145 states and 30616 transitions. Word has length 60 [2019-12-18 14:36:37,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:37,093 INFO L462 AbstractCegarLoop]: Abstraction has 10145 states and 30616 transitions. [2019-12-18 14:36:37,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:36:37,093 INFO L276 IsEmpty]: Start isEmpty. Operand 10145 states and 30616 transitions. [2019-12-18 14:36:37,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 14:36:37,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:37,107 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] [2019-12-18 14:36:37,107 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:37,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:37,108 INFO L82 PathProgramCache]: Analyzing trace with hash -957409570, now seen corresponding path program 2 times [2019-12-18 14:36:37,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:37,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690342257] [2019-12-18 14:36:37,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:37,298 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-12-18 14:36:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:37,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690342257] [2019-12-18 14:36:37,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:37,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:36:37,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724104527] [2019-12-18 14:36:37,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:36:37,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:37,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:36:37,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:36:37,319 INFO L87 Difference]: Start difference. First operand 10145 states and 30616 transitions. Second operand 6 states. [2019-12-18 14:36:37,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:37,719 INFO L93 Difference]: Finished difference Result 14790 states and 43663 transitions. [2019-12-18 14:36:37,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:36:37,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 14:36:37,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:37,740 INFO L225 Difference]: With dead ends: 14790 [2019-12-18 14:36:37,740 INFO L226 Difference]: Without dead ends: 14790 [2019-12-18 14:36:37,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:36:37,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14790 states. [2019-12-18 14:36:37,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14790 to 11537. [2019-12-18 14:36:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11537 states. [2019-12-18 14:36:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11537 states to 11537 states and 34548 transitions. [2019-12-18 14:36:37,920 INFO L78 Accepts]: Start accepts. Automaton has 11537 states and 34548 transitions. Word has length 60 [2019-12-18 14:36:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:37,920 INFO L462 AbstractCegarLoop]: Abstraction has 11537 states and 34548 transitions. [2019-12-18 14:36:37,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:36:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 11537 states and 34548 transitions. [2019-12-18 14:36:37,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-18 14:36:37,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:37,935 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-18 14:36:37,935 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:37,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:37,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1753304090, now seen corresponding path program 1 times [2019-12-18 14:36:37,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:37,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052265628] [2019-12-18 14:36:37,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:38,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052265628] [2019-12-18 14:36:38,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:38,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:36:38,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057629120] [2019-12-18 14:36:38,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:36:38,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:38,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:36:38,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:36:38,054 INFO L87 Difference]: Start difference. First operand 11537 states and 34548 transitions. Second operand 6 states. [2019-12-18 14:36:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:38,528 INFO L93 Difference]: Finished difference Result 14513 states and 42851 transitions. [2019-12-18 14:36:38,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:36:38,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-18 14:36:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:38,548 INFO L225 Difference]: With dead ends: 14513 [2019-12-18 14:36:38,548 INFO L226 Difference]: Without dead ends: 14513 [2019-12-18 14:36:38,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:36:38,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14513 states. [2019-12-18 14:36:38,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14513 to 12017. [2019-12-18 14:36:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12017 states. [2019-12-18 14:36:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12017 states to 12017 states and 35962 transitions. [2019-12-18 14:36:38,756 INFO L78 Accepts]: Start accepts. Automaton has 12017 states and 35962 transitions. Word has length 61 [2019-12-18 14:36:38,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:38,756 INFO L462 AbstractCegarLoop]: Abstraction has 12017 states and 35962 transitions. [2019-12-18 14:36:38,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:36:38,756 INFO L276 IsEmpty]: Start isEmpty. Operand 12017 states and 35962 transitions. [2019-12-18 14:36:38,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-18 14:36:38,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:38,769 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-18 14:36:38,770 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:38,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:38,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1997127970, now seen corresponding path program 2 times [2019-12-18 14:36:38,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:38,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185423318] [2019-12-18 14:36:38,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:38,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185423318] [2019-12-18 14:36:38,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:38,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:36:38,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887199747] [2019-12-18 14:36:38,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:36:38,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:38,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:36:38,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:38,843 INFO L87 Difference]: Start difference. First operand 12017 states and 35962 transitions. Second operand 3 states. [2019-12-18 14:36:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:38,895 INFO L93 Difference]: Finished difference Result 12016 states and 35960 transitions. [2019-12-18 14:36:38,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:36:38,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-18 14:36:38,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:38,914 INFO L225 Difference]: With dead ends: 12016 [2019-12-18 14:36:38,914 INFO L226 Difference]: Without dead ends: 12016 [2019-12-18 14:36:38,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:38,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12016 states. [2019-12-18 14:36:39,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12016 to 8169. [2019-12-18 14:36:39,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8169 states. [2019-12-18 14:36:39,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8169 states to 8169 states and 24956 transitions. [2019-12-18 14:36:39,064 INFO L78 Accepts]: Start accepts. Automaton has 8169 states and 24956 transitions. Word has length 61 [2019-12-18 14:36:39,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:39,065 INFO L462 AbstractCegarLoop]: Abstraction has 8169 states and 24956 transitions. [2019-12-18 14:36:39,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:36:39,065 INFO L276 IsEmpty]: Start isEmpty. Operand 8169 states and 24956 transitions. [2019-12-18 14:36:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 14:36:39,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:39,074 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-18 14:36:39,074 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:39,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:39,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1856578317, now seen corresponding path program 1 times [2019-12-18 14:36:39,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:39,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96862260] [2019-12-18 14:36:39,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:39,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96862260] [2019-12-18 14:36:39,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:39,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:36:39,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175210066] [2019-12-18 14:36:39,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:36:39,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:39,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:36:39,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:39,166 INFO L87 Difference]: Start difference. First operand 8169 states and 24956 transitions. Second operand 3 states. [2019-12-18 14:36:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:39,203 INFO L93 Difference]: Finished difference Result 8109 states and 24588 transitions. [2019-12-18 14:36:39,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:36:39,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-18 14:36:39,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:39,218 INFO L225 Difference]: With dead ends: 8109 [2019-12-18 14:36:39,218 INFO L226 Difference]: Without dead ends: 8109 [2019-12-18 14:36:39,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8109 states. [2019-12-18 14:36:39,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8109 to 7689. [2019-12-18 14:36:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7689 states. [2019-12-18 14:36:39,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 23380 transitions. [2019-12-18 14:36:39,385 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 23380 transitions. Word has length 62 [2019-12-18 14:36:39,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:39,385 INFO L462 AbstractCegarLoop]: Abstraction has 7689 states and 23380 transitions. [2019-12-18 14:36:39,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:36:39,385 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 23380 transitions. [2019-12-18 14:36:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 14:36:39,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:39,398 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-18 14:36:39,398 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:39,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:39,399 INFO L82 PathProgramCache]: Analyzing trace with hash 687699090, now seen corresponding path program 1 times [2019-12-18 14:36:39,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:39,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633799672] [2019-12-18 14:36:39,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:39,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633799672] [2019-12-18 14:36:39,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:39,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:36:39,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283015418] [2019-12-18 14:36:39,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:36:39,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:39,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:36:39,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:39,551 INFO L87 Difference]: Start difference. First operand 7689 states and 23380 transitions. Second operand 3 states. [2019-12-18 14:36:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:39,588 INFO L93 Difference]: Finished difference Result 7515 states and 22689 transitions. [2019-12-18 14:36:39,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:36:39,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-18 14:36:39,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:39,601 INFO L225 Difference]: With dead ends: 7515 [2019-12-18 14:36:39,601 INFO L226 Difference]: Without dead ends: 7515 [2019-12-18 14:36:39,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:39,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7515 states. [2019-12-18 14:36:39,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7515 to 6963. [2019-12-18 14:36:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6963 states. [2019-12-18 14:36:39,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6963 states to 6963 states and 21113 transitions. [2019-12-18 14:36:39,796 INFO L78 Accepts]: Start accepts. Automaton has 6963 states and 21113 transitions. Word has length 62 [2019-12-18 14:36:39,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:39,796 INFO L462 AbstractCegarLoop]: Abstraction has 6963 states and 21113 transitions. [2019-12-18 14:36:39,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:36:39,797 INFO L276 IsEmpty]: Start isEmpty. Operand 6963 states and 21113 transitions. [2019-12-18 14:36:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 14:36:39,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:39,806 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-18 14:36:39,807 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:39,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:39,807 INFO L82 PathProgramCache]: Analyzing trace with hash 249256444, now seen corresponding path program 1 times [2019-12-18 14:36:39,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:39,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612204140] [2019-12-18 14:36:39,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:39,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612204140] [2019-12-18 14:36:39,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:39,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:36:39,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585175637] [2019-12-18 14:36:39,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:36:39,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:39,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:36:39,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:36:39,907 INFO L87 Difference]: Start difference. First operand 6963 states and 21113 transitions. Second operand 4 states. [2019-12-18 14:36:39,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:39,957 INFO L93 Difference]: Finished difference Result 8427 states and 25096 transitions. [2019-12-18 14:36:39,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:36:39,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-18 14:36:39,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:39,961 INFO L225 Difference]: With dead ends: 8427 [2019-12-18 14:36:39,962 INFO L226 Difference]: Without dead ends: 2907 [2019-12-18 14:36:39,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:36:39,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2019-12-18 14:36:40,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2835. [2019-12-18 14:36:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2835 states. [2019-12-18 14:36:40,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2835 states and 7850 transitions. [2019-12-18 14:36:40,017 INFO L78 Accepts]: Start accepts. Automaton has 2835 states and 7850 transitions. Word has length 63 [2019-12-18 14:36:40,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:40,018 INFO L462 AbstractCegarLoop]: Abstraction has 2835 states and 7850 transitions. [2019-12-18 14:36:40,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:36:40,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 7850 transitions. [2019-12-18 14:36:40,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 14:36:40,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:40,022 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-18 14:36:40,022 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:40,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:40,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1682076282, now seen corresponding path program 2 times [2019-12-18 14:36:40,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:40,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216371813] [2019-12-18 14:36:40,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:40,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:40,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216371813] [2019-12-18 14:36:40,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:40,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:36:40,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075004774] [2019-12-18 14:36:40,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:36:40,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:40,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:36:40,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:36:40,169 INFO L87 Difference]: Start difference. First operand 2835 states and 7850 transitions. Second operand 5 states. [2019-12-18 14:36:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:40,211 INFO L93 Difference]: Finished difference Result 4541 states and 12515 transitions. [2019-12-18 14:36:40,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:36:40,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-18 14:36:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:40,214 INFO L225 Difference]: With dead ends: 4541 [2019-12-18 14:36:40,214 INFO L226 Difference]: Without dead ends: 1934 [2019-12-18 14:36:40,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:36:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2019-12-18 14:36:40,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1934. [2019-12-18 14:36:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2019-12-18 14:36:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 5237 transitions. [2019-12-18 14:36:40,252 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 5237 transitions. Word has length 63 [2019-12-18 14:36:40,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:40,253 INFO L462 AbstractCegarLoop]: Abstraction has 1934 states and 5237 transitions. [2019-12-18 14:36:40,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:36:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 5237 transitions. [2019-12-18 14:36:40,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 14:36:40,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:40,255 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-18 14:36:40,256 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:40,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:40,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1116199452, now seen corresponding path program 3 times [2019-12-18 14:36:40,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:40,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790420966] [2019-12-18 14:36:40,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:36:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:36:40,483 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:36:40,483 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:36:40,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse1 (store |v_#valid_75| 0 0))) (let ((.cse0 (store .cse1 |v_~#x~0.base_140| 1))) (and (= (select (select |v_#memory_int_277| |v_~#x~0.base_140|) |v_~#x~0.offset_140|) 0) (= 0 v_~x$r_buff0_thd1~0_68) (= v_~x$r_buff1_thd3~0_58 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd3~0_8 0) (= v_~x$r_buff1_thd1~0_56 0) (= v_~__unbuffered_p1_EAX$r_buff1_thd3~0_7 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p0_EAX~0_58) (= v_~__unbuffered_p1_EAX$w_buff1_used~0_8 0) (= 0 v_~x$read_delayed~0_7) (= v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8 0) (= 0 v_~weak$$choice2~0_98) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t2000~0.base_24| 1)) (= 0 v_~x$r_buff0_thd0~0_92) (= v_~__unbuffered_p1_EAX$w_buff0~0_8 0) (= 0 v_~x$r_buff0_thd3~0_78) (= 0 v_~x$w_buff0~0_96) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_cnt~0_77) (= v_~main$tmp_guard0~0_54 0) (= 0 v_~x$r_buff0_thd2~0_264) (= v_~__unbuffered_p1_EAX$r_buff0_thd1~0_8 0) (= 0 v_~weak$$choice1~0_32) (= v_~__unbuffered_p1_EAX$w_buff1~0_8 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7 0) (= v_~x$mem_tmp~0_39 0) (= 0 (select .cse1 |v_~#x~0.base_140|)) (< 0 |v_#StackHeapBarrier_22|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2000~0.base_24|) (= 0 v_~x$w_buff1~0_81) (= 0 v_~__unbuffered_p1_EAX~0_61) (= v_~x$flush_delayed~0_68 0) (= 0 v_~x$r_buff1_thd2~0_177) (= v_~__unbuffered_p1_EAX$r_buff0_thd2~0_8 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2000~0.base_24|) 0) (= v_~__unbuffered_p1_EAX$flush_delayed~0_8 0) (= 0 v_~weak$$choice0~0_17) (= v_~__unbuffered_p1_EAX$r_buff1_thd2~0_8 0) (= 0 v_~x$w_buff0_used~0_579) (= v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8 0) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_35 0) (= v_~y~0_85 0) (= 0 |v_#NULL.base_4|) (= 0 |v_ULTIMATE.start_main_~#t2000~0.offset_18|) (= 0 |v_~#x~0.offset_140|) (= v_~__unbuffered_p1_EAX$read_delayed~0_41 0) (= v_~main$tmp_guard1~0_32 0) (= v_~__unbuffered_p1_EAX$w_buff0_used~0_7 0) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_35 0) (= 0 v_~x$w_buff1_used~0_346) (= |v_#length_36| (store (store |v_#length_37| |v_~#x~0.base_140| 4) |v_ULTIMATE.start_main_~#t2000~0.base_24| 4)) (= |v_#NULL.offset_4| 0) (= 0 v_~__unbuffered_p1_EAX$mem_tmp~0_8) (= (store |v_#memory_int_277| |v_ULTIMATE.start_main_~#t2000~0.base_24| (store (select |v_#memory_int_277| |v_ULTIMATE.start_main_~#t2000~0.base_24|) |v_ULTIMATE.start_main_~#t2000~0.offset_18| 0)) |v_#memory_int_276|) (< |v_#StackHeapBarrier_22| |v_~#x~0.base_140|) (= v_~x$r_buff1_thd0~0_55 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_277|, #length=|v_#length_37|} OutVars{ULTIMATE.start_main_#t~nondet53=|v_ULTIMATE.start_main_#t~nondet53_26|, ~x$w_buff0~0=v_~x$w_buff0~0_96, ULTIMATE.start_main_#t~nondet51=|v_ULTIMATE.start_main_#t~nondet51_10|, ~__unbuffered_p1_EAX$r_buff0_thd0~0=v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7, ~__unbuffered_p1_EAX$r_buff1_thd2~0=v_~__unbuffered_p1_EAX$r_buff1_thd2~0_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_68, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_56, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_78, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_59|, ~weak$$choice1~0=v_~weak$$choice1~0_32, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_61, ~__unbuffered_p1_EAX$w_buff0~0=v_~__unbuffered_p1_EAX$w_buff0~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_35, #length=|v_#length_36|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_92, ULTIMATE.start_main_#t~mem54=|v_ULTIMATE.start_main_#t~mem54_26|, ~__unbuffered_p1_EAX$r_buff0_thd1~0=v_~__unbuffered_p1_EAX$r_buff0_thd1~0_8, ~#x~0.offset=|v_~#x~0.offset_140|, ~x$w_buff1~0=v_~x$w_buff1~0_81, ~__unbuffered_p1_EAX$r_buff1_thd3~0=v_~__unbuffered_p1_EAX$r_buff1_thd3~0_7, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_169|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_346, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_177, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_46|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_48|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~__unbuffered_p1_EAX$w_buff1_used~0=v_~__unbuffered_p1_EAX$w_buff1_used~0_8, ~__unbuffered_p1_EAX$w_buff1~0=v_~__unbuffered_p1_EAX$w_buff1~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~__unbuffered_p1_EAX$r_buff0_thd2~0=v_~__unbuffered_p1_EAX$r_buff0_thd2~0_8, ~__unbuffered_p1_EAX$r_buff1_thd0~0=v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8, ~__unbuffered_p1_EAX$flush_delayed~0=v_~__unbuffered_p1_EAX$flush_delayed~0_8, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_68, ULTIMATE.start_main_#t~nondet52=|v_ULTIMATE.start_main_#t~nondet52_9|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_41, ULTIMATE.start_main_#t~mem62=|v_ULTIMATE.start_main_#t~mem62_43|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_58, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_39, ULTIMATE.start_main_~#t2002~0.offset=|v_ULTIMATE.start_main_~#t2002~0.offset_17|, ~__unbuffered_p1_EAX$mem_tmp~0=v_~__unbuffered_p1_EAX$mem_tmp~0_8, ULTIMATE.start_main_~#t2000~0.base=|v_ULTIMATE.start_main_~#t2000~0.base_24|, ~y~0=v_~y~0_85, ~__unbuffered_p1_EAX$r_buff0_thd3~0=v_~__unbuffered_p1_EAX$r_buff0_thd3~0_8, ~__unbuffered_p1_EAX$r_buff1_thd1~0=v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_149|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_35, ULTIMATE.start_main_~#t2001~0.offset=|v_ULTIMATE.start_main_~#t2001~0.offset_20|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_54, ULTIMATE.start_main_~#t2001~0.base=|v_ULTIMATE.start_main_~#t2001~0.base_25|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_55, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_264, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_31|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_579, ~__unbuffered_p1_EAX$w_buff0_used~0=v_~__unbuffered_p1_EAX$w_buff0_used~0_7, ULTIMATE.start_main_~#t2002~0.base=|v_ULTIMATE.start_main_~#t2002~0.base_21|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_28|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_276|, ~#x~0.base=|v_~#x~0.base_140|, ~weak$$choice2~0=v_~weak$$choice2~0_98, ULTIMATE.start_main_~#t2000~0.offset=|v_ULTIMATE.start_main_~#t2000~0.offset_18|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet53, ~x$w_buff0~0, ULTIMATE.start_main_#t~nondet51, ~__unbuffered_p1_EAX$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff1_thd2~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite64, ~weak$$choice1~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$w_buff0~0, ~__unbuffered_p1_EAX$read_delayed_var~0.base, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem54, ~__unbuffered_p1_EAX$r_buff0_thd1~0, ~#x~0.offset, ~x$w_buff1~0, ~__unbuffered_p1_EAX$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite56, ~x$read_delayed_var~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~__unbuffered_p1_EAX$w_buff1_used~0, ~__unbuffered_p1_EAX$w_buff1~0, ~__unbuffered_cnt~0, ~__unbuffered_p1_EAX$r_buff0_thd2~0, ~__unbuffered_p1_EAX$r_buff1_thd0~0, ~__unbuffered_p1_EAX$flush_delayed~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet52, ~__unbuffered_p1_EAX$read_delayed~0, ULTIMATE.start_main_#t~mem62, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t2002~0.offset, ~__unbuffered_p1_EAX$mem_tmp~0, ULTIMATE.start_main_~#t2000~0.base, ~y~0, ~__unbuffered_p1_EAX$r_buff0_thd3~0, ~__unbuffered_p1_EAX$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite57, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2001~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2001~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet61, #NULL.base, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX$w_buff0_used~0, ULTIMATE.start_main_~#t2002~0.base, ULTIMATE.start_main_#t~ite60, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~#x~0.base, ~weak$$choice2~0, ULTIMATE.start_main_~#t2000~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 14:36:40,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [912] [912] L825-1-->L827: Formula: (and (= |v_ULTIMATE.start_main_~#t2001~0.offset_10| 0) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2001~0.base_11|) 0) (= (store |v_#memory_int_139| |v_ULTIMATE.start_main_~#t2001~0.base_11| (store (select |v_#memory_int_139| |v_ULTIMATE.start_main_~#t2001~0.base_11|) |v_ULTIMATE.start_main_~#t2001~0.offset_10| 1)) |v_#memory_int_138|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2001~0.base_11| 4)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2001~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2001~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2001~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_139|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet51=|v_ULTIMATE.start_main_#t~nondet51_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_138|, ULTIMATE.start_main_~#t2001~0.offset=|v_ULTIMATE.start_main_~#t2001~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_~#t2001~0.base=|v_ULTIMATE.start_main_~#t2001~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet51, #valid, #memory_int, ULTIMATE.start_main_~#t2001~0.offset, #length, ULTIMATE.start_main_~#t2001~0.base] because there is no mapped edge [2019-12-18 14:36:40,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [928] [928] L827-1-->L829: Formula: (and (= |v_ULTIMATE.start_main_~#t2002~0.offset_11| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2002~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2002~0.base_13|) (= (store |v_#memory_int_203| |v_ULTIMATE.start_main_~#t2002~0.base_13| (store (select |v_#memory_int_203| |v_ULTIMATE.start_main_~#t2002~0.base_13|) |v_ULTIMATE.start_main_~#t2002~0.offset_11| 2)) |v_#memory_int_202|) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t2002~0.base_13|) 0) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t2002~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2002~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_203|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t2002~0.base=|v_ULTIMATE.start_main_~#t2002~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet52=|v_ULTIMATE.start_main_#t~nondet52_5|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_202|, ULTIMATE.start_main_~#t2002~0.offset=|v_ULTIMATE.start_main_~#t2002~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2002~0.base, ULTIMATE.start_main_#t~nondet52, #valid, #memory_int, ULTIMATE.start_main_~#t2002~0.offset, #length] because there is no mapped edge [2019-12-18 14:36:40,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L769-->L770: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1235198484 256))) (.cse1 (= ~x$w_buff0~0_In-1235198484 ~x$w_buff0~0_Out-1235198484))) (or (and (not .cse0) .cse1) (let ((.cse2 (not (= (mod ~x$r_buff0_thd2~0_In-1235198484 256) 0)))) (and (or (not (= (mod ~x$r_buff1_thd2~0_In-1235198484 256) 0)) .cse2) (not (= 0 (mod ~x$w_buff0_used~0_In-1235198484 256))) .cse0 (or (not (= (mod ~x$w_buff1_used~0_In-1235198484 256) 0)) .cse2) .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1235198484, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1235198484, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1235198484, ~weak$$choice2~0=~weak$$choice2~0_In-1235198484, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1235198484, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1235198484} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-1235198484, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1235198484, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1235198484, P1Thread1of1ForFork0_#t~ite16=|P1Thread1of1ForFork0_#t~ite16_Out-1235198484|, ~weak$$choice2~0=~weak$$choice2~0_In-1235198484, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1235198484, P1Thread1of1ForFork0_#t~ite18=|P1Thread1of1ForFork0_#t~ite18_Out-1235198484|, P1Thread1of1ForFork0_#t~ite17=|P1Thread1of1ForFork0_#t~ite17_Out-1235198484|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1235198484} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_#t~ite16, P1Thread1of1ForFork0_#t~ite18, P1Thread1of1ForFork0_#t~ite17] because there is no mapped edge [2019-12-18 14:36:40,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L770-->L771: Formula: (and (= v_~x$w_buff1~0_31 v_~x$w_buff1~0_30) (not (= 0 (mod v_~weak$$choice2~0_25 256)))) InVars {~x$w_buff1~0=v_~x$w_buff1~0_31, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P1Thread1of1ForFork0_#t~ite19=|v_P1Thread1of1ForFork0_#t~ite19_12|, P1Thread1of1ForFork0_#t~ite20=|v_P1Thread1of1ForFork0_#t~ite20_11|, P1Thread1of1ForFork0_#t~ite21=|v_P1Thread1of1ForFork0_#t~ite21_9|, ~x$w_buff1~0=v_~x$w_buff1~0_30, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite19, P1Thread1of1ForFork0_#t~ite20, P1Thread1of1ForFork0_#t~ite21, ~x$w_buff1~0] because there is no mapped edge [2019-12-18 14:36:40,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L771-->L771-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In103848832 256)))) (or (and (= ~x$w_buff0_used~0_In103848832 |P1Thread1of1ForFork0_#t~ite24_Out103848832|) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite23_In103848832| |P1Thread1of1ForFork0_#t~ite23_Out103848832|)) (and (= |P1Thread1of1ForFork0_#t~ite24_Out103848832| |P1Thread1of1ForFork0_#t~ite23_Out103848832|) .cse0 (= ~x$w_buff0_used~0_In103848832 |P1Thread1of1ForFork0_#t~ite23_Out103848832|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In103848832 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd2~0_In103848832 256) 0)) (= (mod ~x$w_buff0_used~0_In103848832 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In103848832 256) 0))))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In103848832, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In103848832, P1Thread1of1ForFork0_#t~ite23=|P1Thread1of1ForFork0_#t~ite23_In103848832|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In103848832, ~weak$$choice2~0=~weak$$choice2~0_In103848832, ~x$w_buff0_used~0=~x$w_buff0_used~0_In103848832} OutVars{P1Thread1of1ForFork0_#t~ite24=|P1Thread1of1ForFork0_#t~ite24_Out103848832|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In103848832, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In103848832, P1Thread1of1ForFork0_#t~ite23=|P1Thread1of1ForFork0_#t~ite23_Out103848832|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In103848832, ~weak$$choice2~0=~weak$$choice2~0_In103848832, ~x$w_buff0_used~0=~x$w_buff0_used~0_In103848832} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite24, P1Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-18 14:36:40,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L773-->L774: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_In-145777485 ~x$r_buff0_thd2~0_Out-145777485)) (.cse1 (= 0 (mod ~weak$$choice2~0_In-145777485 256)))) (or (and .cse0 (not .cse1)) (and .cse0 .cse1 (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In-145777485 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd2~0_In-145777485 256)) .cse2) (= (mod ~x$w_buff0_used~0_In-145777485 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In-145777485 256)) .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-145777485, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-145777485, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-145777485, ~weak$$choice2~0=~weak$$choice2~0_In-145777485, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-145777485} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-145777485|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-145777485, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-145777485, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-145777485, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-145777485|, ~weak$$choice2~0=~weak$$choice2~0_In-145777485, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-145777485|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-145777485} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite28, P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 14:36:40,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L774-->L778: Formula: (and (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_12 |v_~#x~0.base_41|) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_12 |v_~#x~0.offset_41|) (= (select (select |v_#memory_int_75| |v_~#x~0.base_41|) |v_~#x~0.offset_41|) v_~__unbuffered_p1_EAX~0_17) (= v_~x$r_buff1_thd2~0_56 v_~x$r_buff1_thd2~0_55) (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~__unbuffered_p1_EAX$read_delayed~0_13 1)) InVars {~#x~0.offset=|v_~#x~0.offset_41|, ~#x~0.base=|v_~#x~0.base_41|, #memory_int=|v_#memory_int_75|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{~#x~0.offset=|v_~#x~0.offset_41|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_13, P1Thread1of1ForFork0_#t~mem34=|v_P1Thread1of1ForFork0_#t~mem34_8|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_12, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, P1Thread1of1ForFork0_#t~ite33=|v_P1Thread1of1ForFork0_#t~ite33_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_12|, P1Thread1of1ForFork0_#t~ite32=|v_P1Thread1of1ForFork0_#t~ite32_15|, ~#x~0.base=|v_~#x~0.base_41|, #memory_int=|v_#memory_int_75|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_12, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_p1_EAX$read_delayed~0, P1Thread1of1ForFork0_#t~ite32, P1Thread1of1ForFork0_#t~mem34, ~__unbuffered_p1_EAX$read_delayed_var~0.base, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~x$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite33] because there is no mapped edge [2019-12-18 14:36:40,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L778-->L785: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= (store |v_#memory_int_46| |v_~#x~0.base_27| (store (select |v_#memory_int_46| |v_~#x~0.base_27|) |v_~#x~0.offset_27| v_~x$mem_tmp~0_4)) |v_#memory_int_45|) (not (= 0 (mod v_~x$flush_delayed~0_7 256))) (= v_~y~0_10 1)) InVars {~#x~0.offset=|v_~#x~0.offset_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, #memory_int=|v_#memory_int_46|, ~#x~0.base=|v_~#x~0.base_27|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~#x~0.offset=|v_~#x~0.offset_27|, P1Thread1of1ForFork0_#t~mem35=|v_P1Thread1of1ForFork0_#t~mem35_5|, #memory_int=|v_#memory_int_45|, ~#x~0.base=|v_~#x~0.base_27|, P1Thread1of1ForFork0_#t~ite36=|v_P1Thread1of1ForFork0_#t~ite36_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~y~0=v_~y~0_10} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork0_#t~mem35, #memory_int, P1Thread1of1ForFork0_#t~ite36, ~y~0] because there is no mapped edge [2019-12-18 14:36:40,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L785-2-->L785-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite39_Out-1693834608| |P1Thread1of1ForFork0_#t~ite38_Out-1693834608|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1693834608 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1693834608 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork0_#t~mem37_Out-1693834608| |P1Thread1of1ForFork0_#t~ite38_Out-1693834608|) (or .cse1 .cse2) (= (select (select |#memory_int_In-1693834608| |~#x~0.base_In-1693834608|) |~#x~0.offset_In-1693834608|) |P1Thread1of1ForFork0_#t~mem37_Out-1693834608|)) (and .cse0 (= |P1Thread1of1ForFork0_#t~mem37_In-1693834608| |P1Thread1of1ForFork0_#t~mem37_Out-1693834608|) (not .cse2) (= ~x$w_buff1~0_In-1693834608 |P1Thread1of1ForFork0_#t~ite38_Out-1693834608|) (not .cse1)))) InVars {P1Thread1of1ForFork0_#t~mem37=|P1Thread1of1ForFork0_#t~mem37_In-1693834608|, ~#x~0.offset=|~#x~0.offset_In-1693834608|, ~x$w_buff1~0=~x$w_buff1~0_In-1693834608, ~#x~0.base=|~#x~0.base_In-1693834608|, #memory_int=|#memory_int_In-1693834608|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1693834608, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1693834608} OutVars{P1Thread1of1ForFork0_#t~mem37=|P1Thread1of1ForFork0_#t~mem37_Out-1693834608|, ~#x~0.offset=|~#x~0.offset_In-1693834608|, ~x$w_buff1~0=~x$w_buff1~0_In-1693834608, ~#x~0.base=|~#x~0.base_In-1693834608|, #memory_int=|#memory_int_In-1693834608|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1693834608, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1693834608, P1Thread1of1ForFork0_#t~ite39=|P1Thread1of1ForFork0_#t~ite39_Out-1693834608|, P1Thread1of1ForFork0_#t~ite38=|P1Thread1of1ForFork0_#t~ite38_Out-1693834608|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem37, P1Thread1of1ForFork0_#t~ite39, P1Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 14:36:40,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In308180485 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In308180485 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite45_Out308180485| |P2Thread1of1ForFork1_#t~mem44_Out308180485|) (or .cse0 .cse1) (= (select (select |#memory_int_In308180485| |~#x~0.base_In308180485|) |~#x~0.offset_In308180485|) |P2Thread1of1ForFork1_#t~mem44_Out308180485|)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~mem44_In308180485| |P2Thread1of1ForFork1_#t~mem44_Out308180485|) (= |P2Thread1of1ForFork1_#t~ite45_Out308180485| ~x$w_buff1~0_In308180485) (not .cse1)))) InVars {~#x~0.offset=|~#x~0.offset_In308180485|, ~x$w_buff1~0=~x$w_buff1~0_In308180485, ~#x~0.base=|~#x~0.base_In308180485|, #memory_int=|#memory_int_In308180485|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In308180485, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In308180485, P2Thread1of1ForFork1_#t~mem44=|P2Thread1of1ForFork1_#t~mem44_In308180485|} OutVars{~#x~0.offset=|~#x~0.offset_In308180485|, P2Thread1of1ForFork1_#t~ite45=|P2Thread1of1ForFork1_#t~ite45_Out308180485|, ~x$w_buff1~0=~x$w_buff1~0_In308180485, ~#x~0.base=|~#x~0.base_In308180485|, #memory_int=|#memory_int_In308180485|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In308180485, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In308180485, P2Thread1of1ForFork1_#t~mem44=|P2Thread1of1ForFork1_#t~mem44_Out308180485|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite45, P2Thread1of1ForFork1_#t~mem44] because there is no mapped edge [2019-12-18 14:36:40,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In652682148 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In652682148 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite40_Out652682148| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In652682148 |P1Thread1of1ForFork0_#t~ite40_Out652682148|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In652682148, ~x$w_buff0_used~0=~x$w_buff0_used~0_In652682148} OutVars{P1Thread1of1ForFork0_#t~ite40=|P1Thread1of1ForFork0_#t~ite40_Out652682148|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In652682148, ~x$w_buff0_used~0=~x$w_buff0_used~0_In652682148} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 14:36:40,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-715187232 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-715187232 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-715187232 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-715187232 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite41_Out-715187232|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-715187232 |P1Thread1of1ForFork0_#t~ite41_Out-715187232|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-715187232, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-715187232, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-715187232, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-715187232} OutVars{P1Thread1of1ForFork0_#t~ite41=|P1Thread1of1ForFork0_#t~ite41_Out-715187232|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-715187232, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-715187232, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-715187232, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-715187232} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 14:36:40,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L788-->L789: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2074780679 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-2074780679 256) 0))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out-2074780679 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-2074780679 ~x$r_buff0_thd2~0_In-2074780679)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2074780679, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2074780679} OutVars{P1Thread1of1ForFork0_#t~ite42=|P1Thread1of1ForFork0_#t~ite42_Out-2074780679|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2074780679, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2074780679} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite42, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:36:40,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1719380248 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1719380248 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1719380248 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In1719380248 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite43_Out1719380248| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$r_buff1_thd2~0_In1719380248 |P1Thread1of1ForFork0_#t~ite43_Out1719380248|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1719380248, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1719380248, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1719380248, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1719380248} OutVars{P1Thread1of1ForFork0_#t~ite43=|P1Thread1of1ForFork0_#t~ite43_Out1719380248|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1719380248, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1719380248, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1719380248, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1719380248} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 14:36:40,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork0_#t~ite43_32|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P1Thread1of1ForFork0_#t~ite43=|v_P1Thread1of1ForFork0_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P1Thread1of1ForFork0_#t~ite43=|v_P1Thread1of1ForFork0_#t~ite43_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite43, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 14:36:40,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L750-2-->L750-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork2_#t~ite4_Out1676752957| |P0Thread1of1ForFork2_#t~ite5_Out1676752957|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1676752957 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In1676752957 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite4_Out1676752957| |P0Thread1of1ForFork2_#t~mem3_Out1676752957|) .cse0 (or .cse1 .cse2) (= |P0Thread1of1ForFork2_#t~mem3_Out1676752957| (select (select |#memory_int_In1676752957| |~#x~0.base_In1676752957|) |~#x~0.offset_In1676752957|))) (and (= |P0Thread1of1ForFork2_#t~mem3_In1676752957| |P0Thread1of1ForFork2_#t~mem3_Out1676752957|) .cse0 (not .cse1) (= |P0Thread1of1ForFork2_#t~ite4_Out1676752957| ~x$w_buff1~0_In1676752957) (not .cse2)))) InVars {P0Thread1of1ForFork2_#t~mem3=|P0Thread1of1ForFork2_#t~mem3_In1676752957|, ~#x~0.offset=|~#x~0.offset_In1676752957|, ~x$w_buff1~0=~x$w_buff1~0_In1676752957, ~#x~0.base=|~#x~0.base_In1676752957|, #memory_int=|#memory_int_In1676752957|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1676752957, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1676752957} OutVars{P0Thread1of1ForFork2_#t~ite4=|P0Thread1of1ForFork2_#t~ite4_Out1676752957|, P0Thread1of1ForFork2_#t~mem3=|P0Thread1of1ForFork2_#t~mem3_Out1676752957|, ~#x~0.offset=|~#x~0.offset_In1676752957|, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out1676752957|, ~x$w_buff1~0=~x$w_buff1~0_In1676752957, ~#x~0.base=|~#x~0.base_In1676752957|, #memory_int=|#memory_int_In1676752957|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1676752957, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1676752957} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite4, P0Thread1of1ForFork2_#t~mem3, P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 14:36:40,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In623043603 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In623043603 256)))) (or (and (= ~x$w_buff0_used~0_In623043603 |P0Thread1of1ForFork2_#t~ite6_Out623043603|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork2_#t~ite6_Out623043603|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In623043603, ~x$w_buff0_used~0=~x$w_buff0_used~0_In623043603} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In623043603, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out623043603|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In623043603} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 14:36:40,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-519639880 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-519639880 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-519639880 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-519639880 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork2_#t~ite7_Out-519639880| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork2_#t~ite7_Out-519639880| ~x$w_buff1_used~0_In-519639880)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-519639880, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-519639880, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-519639880, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-519639880} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-519639880, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-519639880|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-519639880, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-519639880, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-519639880} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 14:36:40,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L753-->L754: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-720209126 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-720209126 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_Out-720209126 ~x$r_buff0_thd1~0_In-720209126)) (and (not .cse0) (= 0 ~x$r_buff0_thd1~0_Out-720209126) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-720209126, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-720209126} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-720209126, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-720209126|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-720209126} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 14:36:40,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [892] [892] L754-->L754-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd1~0_In1470250372 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1470250372 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1470250372 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1470250372 256) 0))) (or (and (= ~x$r_buff1_thd1~0_In1470250372 |P0Thread1of1ForFork2_#t~ite9_Out1470250372|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork2_#t~ite9_Out1470250372|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1470250372, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1470250372, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1470250372, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1470250372} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1470250372, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1470250372, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1470250372, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out1470250372|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1470250372} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 14:36:40,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L754-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_50 (+ v_~__unbuffered_cnt~0_51 1)) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite9_24| v_~x$r_buff1_thd1~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_24|} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_34, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_23|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite9, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 14:36:40,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L802-4-->L803: Formula: (= (store |v_#memory_int_71| |v_~#x~0.base_39| (store (select |v_#memory_int_71| |v_~#x~0.base_39|) |v_~#x~0.offset_39| |v_P2Thread1of1ForFork1_#t~ite45_10|)) |v_#memory_int_70|) InVars {~#x~0.offset=|v_~#x~0.offset_39|, P2Thread1of1ForFork1_#t~ite45=|v_P2Thread1of1ForFork1_#t~ite45_10|, #memory_int=|v_#memory_int_71|, ~#x~0.base=|v_~#x~0.base_39|} OutVars{P2Thread1of1ForFork1_#t~ite46=|v_P2Thread1of1ForFork1_#t~ite46_13|, ~#x~0.offset=|v_~#x~0.offset_39|, P2Thread1of1ForFork1_#t~ite45=|v_P2Thread1of1ForFork1_#t~ite45_9|, #memory_int=|v_#memory_int_70|, ~#x~0.base=|v_~#x~0.base_39|, P2Thread1of1ForFork1_#t~mem44=|v_P2Thread1of1ForFork1_#t~mem44_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite46, P2Thread1of1ForFork1_#t~ite45, #memory_int, P2Thread1of1ForFork1_#t~mem44] because there is no mapped edge [2019-12-18 14:36:40,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1374232949 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-1374232949 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite47_Out-1374232949| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1374232949 |P2Thread1of1ForFork1_#t~ite47_Out-1374232949|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1374232949, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1374232949} OutVars{P2Thread1of1ForFork1_#t~ite47=|P2Thread1of1ForFork1_#t~ite47_Out-1374232949|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1374232949, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1374232949} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite47] because there is no mapped edge [2019-12-18 14:36:40,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [888] [888] L804-->L804-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1113486309 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1113486309 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In1113486309 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1113486309 256) 0))) (or (and (= ~x$w_buff1_used~0_In1113486309 |P2Thread1of1ForFork1_#t~ite48_Out1113486309|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork1_#t~ite48_Out1113486309| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1113486309, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1113486309, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1113486309, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1113486309} OutVars{P2Thread1of1ForFork1_#t~ite48=|P2Thread1of1ForFork1_#t~ite48_Out1113486309|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1113486309, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1113486309, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1113486309, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1113486309} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-18 14:36:40,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L805-->L806: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In186373850 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In186373850 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd3~0_Out186373850)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd3~0_In186373850 ~x$r_buff0_thd3~0_Out186373850)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In186373850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In186373850} OutVars{P2Thread1of1ForFork1_#t~ite49=|P2Thread1of1ForFork1_#t~ite49_Out186373850|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_Out186373850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In186373850} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite49, ~x$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 14:36:40,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L806-->L806-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd3~0_In741868229 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In741868229 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In741868229 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In741868229 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite50_Out741868229| ~x$r_buff1_thd3~0_In741868229) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite50_Out741868229|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In741868229, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In741868229, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In741868229, ~x$w_buff0_used~0=~x$w_buff0_used~0_In741868229} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In741868229, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In741868229, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In741868229, P2Thread1of1ForFork1_#t~ite50=|P2Thread1of1ForFork1_#t~ite50_Out741868229|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In741868229} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite50] because there is no mapped edge [2019-12-18 14:36:40,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L806-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_49 |v_P2Thread1of1ForFork1_#t~ite50_42|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork1_#t~ite50=|v_P2Thread1of1ForFork1_#t~ite50_42|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_49, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P2Thread1of1ForFork1_#t~ite50=|v_P2Thread1of1ForFork1_#t~ite50_41|, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#t~ite50, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 14:36:40,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L833-->L835-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= 0 (mod v_~x$r_buff0_thd0~0_22 256)) (= 0 (mod v_~x$w_buff0_used~0_133 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:36:40,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-117983445 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-117983445 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~mem54_In-117983445| |ULTIMATE.start_main_#t~mem54_Out-117983445|) (= |ULTIMATE.start_main_#t~ite55_Out-117983445| ~x$w_buff1~0_In-117983445)) (and (= |ULTIMATE.start_main_#t~mem54_Out-117983445| |ULTIMATE.start_main_#t~ite55_Out-117983445|) (= (select (select |#memory_int_In-117983445| |~#x~0.base_In-117983445|) |~#x~0.offset_In-117983445|) |ULTIMATE.start_main_#t~mem54_Out-117983445|) (or .cse0 .cse1)))) InVars {ULTIMATE.start_main_#t~mem54=|ULTIMATE.start_main_#t~mem54_In-117983445|, ~#x~0.offset=|~#x~0.offset_In-117983445|, ~x$w_buff1~0=~x$w_buff1~0_In-117983445, ~#x~0.base=|~#x~0.base_In-117983445|, #memory_int=|#memory_int_In-117983445|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-117983445, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-117983445} OutVars{ULTIMATE.start_main_#t~mem54=|ULTIMATE.start_main_#t~mem54_Out-117983445|, ~#x~0.offset=|~#x~0.offset_In-117983445|, ~x$w_buff1~0=~x$w_buff1~0_In-117983445, ~#x~0.base=|~#x~0.base_In-117983445|, #memory_int=|#memory_int_In-117983445|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-117983445, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-117983445, ULTIMATE.start_main_#t~ite55=|ULTIMATE.start_main_#t~ite55_Out-117983445|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem54, ULTIMATE.start_main_#t~ite55] because there is no mapped edge [2019-12-18 14:36:40,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L835-4-->L836: Formula: (= (store |v_#memory_int_79| |v_~#x~0.base_42| (store (select |v_#memory_int_79| |v_~#x~0.base_42|) |v_~#x~0.offset_42| |v_ULTIMATE.start_main_#t~ite55_8|)) |v_#memory_int_78|) InVars {~#x~0.offset=|v_~#x~0.offset_42|, #memory_int=|v_#memory_int_79|, ~#x~0.base=|v_~#x~0.base_42|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_8|} OutVars{ULTIMATE.start_main_#t~mem54=|v_ULTIMATE.start_main_#t~mem54_5|, ~#x~0.offset=|v_~#x~0.offset_42|, #memory_int=|v_#memory_int_78|, ~#x~0.base=|v_~#x~0.base_42|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_8|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem54, #memory_int, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite55] because there is no mapped edge [2019-12-18 14:36:40,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1745084696 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1745084696 256)))) (or (and (= |ULTIMATE.start_main_#t~ite57_Out1745084696| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1745084696 |ULTIMATE.start_main_#t~ite57_Out1745084696|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1745084696, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1745084696} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1745084696, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out1745084696|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1745084696} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-18 14:36:40,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L837-->L837-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1239106795 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1239106795 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1239106795 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1239106795 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite58_Out1239106795| 0)) (and (= |ULTIMATE.start_main_#t~ite58_Out1239106795| ~x$w_buff1_used~0_In1239106795) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1239106795, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1239106795, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1239106795, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1239106795} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1239106795, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1239106795|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1239106795, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1239106795, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1239106795} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58] because there is no mapped edge [2019-12-18 14:36:40,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L838-->L839: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1216889161 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1216889161 256) 0))) (or (and (not .cse0) (= ~x$r_buff0_thd0~0_Out1216889161 0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_Out1216889161 ~x$r_buff0_thd0~0_In1216889161) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1216889161, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1216889161} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1216889161, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1216889161|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1216889161} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 14:36:40,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L839-->L843: Formula: (let ((.cse2 (= ~weak$$choice1~0_Out1499995820 |ULTIMATE.start_main_#t~nondet61_In1499995820|)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1499995820 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1499995820 256))) (.cse4 (= (mod ~x$w_buff1_used~0_In1499995820 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1499995820 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_Out1499995820 ~x$r_buff1_thd0~0_In1499995820) .cse2 (or .cse3 .cse4)) (and (= 0 ~x$r_buff1_thd0~0_Out1499995820) .cse2 (or (and (not .cse0) (not .cse1)) (and (not .cse4) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1499995820, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1499995820, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1499995820, ULTIMATE.start_main_#t~nondet61=|ULTIMATE.start_main_#t~nondet61_In1499995820|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1499995820} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1499995820, ~weak$$choice1~0=~weak$$choice1~0_Out1499995820, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1499995820|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1499995820, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1499995820, ULTIMATE.start_main_#t~nondet61=|ULTIMATE.start_main_#t~nondet61_Out1499995820|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1499995820} AuxVars[] AssignedVars[~weak$$choice1~0, ULTIMATE.start_main_#t~ite60, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-18 14:36:40,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L843-->L843-3: Formula: (let ((.cse0 (= (mod ~weak$$choice1~0_In1133270901 256) 0)) (.cse1 (not (= 0 (mod ~__unbuffered_p1_EAX$read_delayed~0_In1133270901 256))))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite63_Out1133270901| ~__unbuffered_p1_EAX~0_In1133270901) .cse1 (= |ULTIMATE.start_main_#t~mem62_In1133270901| |ULTIMATE.start_main_#t~mem62_Out1133270901|)) (and (= |ULTIMATE.start_main_#t~mem62_Out1133270901| |ULTIMATE.start_main_#t~ite63_Out1133270901|) (not .cse0) (= |ULTIMATE.start_main_#t~mem62_Out1133270901| (select (select |#memory_int_In1133270901| ~__unbuffered_p1_EAX$read_delayed_var~0.base_In1133270901) ~__unbuffered_p1_EAX$read_delayed_var~0.offset_In1133270901)) .cse1))) InVars {~weak$$choice1~0=~weak$$choice1~0_In1133270901, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In1133270901, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In1133270901, ULTIMATE.start_main_#t~mem62=|ULTIMATE.start_main_#t~mem62_In1133270901|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In1133270901, #memory_int=|#memory_int_In1133270901|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In1133270901} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1133270901|, ~weak$$choice1~0=~weak$$choice1~0_In1133270901, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In1133270901, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In1133270901, ULTIMATE.start_main_#t~mem62=|ULTIMATE.start_main_#t~mem62_Out1133270901|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In1133270901, #memory_int=|#memory_int_In1133270901|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In1133270901} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~mem62] because there is no mapped edge [2019-12-18 14:36:40,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] L843-3-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (let ((.cse0 (= 2 v_~__unbuffered_p0_EAX~0_31)) (.cse1 (= 1 v_~__unbuffered_p1_EAX~0_27)) (.cse2 (= v_~y~0_36 2))) (or (and (= v_~main$tmp_guard1~0_17 0) .cse0 .cse1 .cse2) (and (= v_~main$tmp_guard1~0_17 1) (or (not .cse0) (not .cse1) (not .cse2))))) (= |v_ULTIMATE.start_main_#t~ite63_28| v_~__unbuffered_p1_EAX~0_27)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~y~0=v_~y~0_36} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_27|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ULTIMATE.start_main_#t~mem62=|v_ULTIMATE.start_main_#t~mem62_21|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y~0=v_~y~0_36, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~mem62, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:36:40,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 14:36:40,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:36:40 BasicIcfg [2019-12-18 14:36:40,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:36:40,668 INFO L168 Benchmark]: Toolchain (without parser) took 38665.25 ms. Allocated memory was 138.4 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 100.1 MB in the beginning and 942.3 MB in the end (delta: -842.3 MB). Peak memory consumption was 574.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:40,668 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 14:36:40,669 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.13 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.7 MB in the beginning and 156.1 MB in the end (delta: -56.5 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:40,669 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.82 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:40,670 INFO L168 Benchmark]: Boogie Preprocessor took 84.68 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:40,670 INFO L168 Benchmark]: RCFGBuilder took 884.83 ms. Allocated memory is still 202.9 MB. Free memory was 150.7 MB in the beginning and 96.0 MB in the end (delta: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:40,671 INFO L168 Benchmark]: TraceAbstraction took 36764.04 ms. Allocated memory was 202.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 95.4 MB in the beginning and 942.3 MB in the end (delta: -846.9 MB). Peak memory consumption was 505.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:40,674 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.76 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 833.13 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.7 MB in the beginning and 156.1 MB in the end (delta: -56.5 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 93.82 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 84.68 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 884.83 ms. Allocated memory is still 202.9 MB. Free memory was 150.7 MB in the beginning and 96.0 MB in the end (delta: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36764.04 ms. Allocated memory was 202.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 95.4 MB in the beginning and 942.3 MB in the end (delta: -846.9 MB). Peak memory consumption was 505.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.2s, 192 ProgramPointsBefore, 86 ProgramPointsAfterwards, 230 TransitionsBefore, 95 TransitionsAfterwards, 19530 CoEnabledTransitionPairs, 8 FixpointIterations, 49 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 33 ChoiceCompositions, 7748 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 24 SemBasedMoverChecksPositive, 222 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 80972 CheckedPairsTotal, 145 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t2000, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L827] FCALL, FORK 0 pthread_create(&t2001, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L829] FCALL, FORK 0 pthread_create(&t2002, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L764] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 2 x$flush_delayed = weak$$choice2 [L767] EXPR 2 \read(x) [L767] 2 x$mem_tmp = x [L768] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 \read(x) [L768] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, \read(x)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L768] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L771] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L772] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L772] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L802] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 __unbuffered_p0_EAX = y [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [\read(x)=1, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=1, y=2] [L750] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L751] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L752] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L803] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L804] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L836] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 183 locations, 1 error locations. Result: UNSAFE, OverallTime: 36.3s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2249 SDtfs, 2967 SDslu, 3715 SDs, 0 SdLazy, 2516 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 40 SyntacticMatches, 17 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88334occurred 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: 9.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 39878 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 969 NumberOfCodeBlocks, 969 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 888 ConstructedInterpolants, 0 QuantifiedInterpolants, 109394 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...