/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi008_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:49:37,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:49:37,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:49:37,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:49:37,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:49:37,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:49:37,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:49:37,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:49:37,740 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:49:37,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:49:37,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:49:37,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:49:37,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:49:37,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:49:37,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:49:37,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:49:37,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:49:37,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:49:37,756 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:49:37,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:49:37,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:49:37,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:49:37,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:49:37,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:49:37,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:49:37,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:49:37,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:49:37,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:49:37,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:49:37,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:49:37,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:49:37,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:49:37,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:49:37,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:49:37,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:49:37,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:49:37,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:49:37,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:49:37,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:49:37,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:49:37,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:49:37,789 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:49:37,802 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:49:37,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:49:37,804 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:49:37,804 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:49:37,804 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:49:37,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:49:37,805 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:49:37,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:49:37,805 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:49:37,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:49:37,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:49:37,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:49:37,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:49:37,806 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:49:37,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:49:37,806 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:49:37,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:49:37,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:49:37,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:49:37,807 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:49:37,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:49:37,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:49:37,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:49:37,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:49:37,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:49:37,808 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:49:37,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:49:37,809 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:49:37,809 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:49:37,809 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:49:37,809 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:49:38,120 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:49:38,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:49:38,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:49:38,146 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:49:38,147 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:49:38,149 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008_power.oepc.i [2019-12-27 17:49:38,215 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f463a154/bbf62267175c4341ae8dc044e5e364ee/FLAGe3723bd0b [2019-12-27 17:49:38,819 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:49:38,820 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008_power.oepc.i [2019-12-27 17:49:38,834 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f463a154/bbf62267175c4341ae8dc044e5e364ee/FLAGe3723bd0b [2019-12-27 17:49:39,054 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f463a154/bbf62267175c4341ae8dc044e5e364ee [2019-12-27 17:49:39,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:49:39,065 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:49:39,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:49:39,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:49:39,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:49:39,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:49:39" (1/1) ... [2019-12-27 17:49:39,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ede25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:39, skipping insertion in model container [2019-12-27 17:49:39,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:49:39" (1/1) ... [2019-12-27 17:49:39,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:49:39,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:49:39,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:49:39,740 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:49:39,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:49:39,879 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:49:39,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:39 WrapperNode [2019-12-27 17:49:39,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:49:39,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:49:39,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:49:39,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:49:39,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:39" (1/1) ... [2019-12-27 17:49:39,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:39" (1/1) ... [2019-12-27 17:49:39,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:49:39,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:49:39,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:49:39,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:49:39,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:39" (1/1) ... [2019-12-27 17:49:39,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:39" (1/1) ... [2019-12-27 17:49:39,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:39" (1/1) ... [2019-12-27 17:49:39,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:39" (1/1) ... [2019-12-27 17:49:39,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:39" (1/1) ... [2019-12-27 17:49:40,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:39" (1/1) ... [2019-12-27 17:49:40,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:39" (1/1) ... [2019-12-27 17:49:40,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:49:40,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:49:40,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:49:40,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:49:40,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:49:40,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:49:40,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:49:40,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:49:40,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:49:40,098 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:49:40,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:49:40,098 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:49:40,099 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:49:40,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:49:40,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:49:40,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:49:40,102 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:49:40,930 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:49:40,931 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:49:40,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:49:40 BoogieIcfgContainer [2019-12-27 17:49:40,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:49:40,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:49:40,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:49:40,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:49:40,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:49:39" (1/3) ... [2019-12-27 17:49:40,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cae692c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:49:40, skipping insertion in model container [2019-12-27 17:49:40,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:39" (2/3) ... [2019-12-27 17:49:40,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cae692c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:49:40, skipping insertion in model container [2019-12-27 17:49:40,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:49:40" (3/3) ... [2019-12-27 17:49:40,940 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_power.oepc.i [2019-12-27 17:49:40,948 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:49:40,949 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:49:40,956 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:49:40,973 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:49:41,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,026 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,026 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,026 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,027 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,027 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,060 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,060 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,092 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,095 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,100 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,101 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,105 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:41,122 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:49:41,144 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:49:41,144 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:49:41,144 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:49:41,145 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:49:41,145 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:49:41,145 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:49:41,145 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:49:41,145 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:49:41,167 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-27 17:49:41,169 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-27 17:49:41,295 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-27 17:49:41,295 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:49:41,312 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 625 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 17:49:41,343 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-27 17:49:41,409 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-27 17:49:41,409 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:49:41,422 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 625 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 17:49:41,458 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-27 17:49:41,459 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:49:47,013 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 17:49:47,162 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146813 [2019-12-27 17:49:47,162 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 17:49:47,166 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 136 transitions [2019-12-27 17:49:48,911 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 29658 states. [2019-12-27 17:49:48,913 INFO L276 IsEmpty]: Start isEmpty. Operand 29658 states. [2019-12-27 17:49:48,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:49:48,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:48,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:49:48,920 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:48,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:48,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1084682, now seen corresponding path program 1 times [2019-12-27 17:49:48,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:48,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220846335] [2019-12-27 17:49:48,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:49,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:49:49,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220846335] [2019-12-27 17:49:49,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:49,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:49:49,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1207619279] [2019-12-27 17:49:49,164 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:49,169 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:49,183 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:49:49,183 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:49,187 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:49:49,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:49:49,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:49,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:49:49,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:49:49,205 INFO L87 Difference]: Start difference. First operand 29658 states. Second operand 3 states. [2019-12-27 17:49:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:49,660 INFO L93 Difference]: Finished difference Result 29506 states and 103746 transitions. [2019-12-27 17:49:49,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:49:49,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:49:49,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:49,959 INFO L225 Difference]: With dead ends: 29506 [2019-12-27 17:49:49,959 INFO L226 Difference]: Without dead ends: 27490 [2019-12-27 17:49:49,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:49:51,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27490 states. [2019-12-27 17:49:52,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27490 to 27490. [2019-12-27 17:49:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27490 states. [2019-12-27 17:49:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27490 states to 27490 states and 96576 transitions. [2019-12-27 17:49:52,276 INFO L78 Accepts]: Start accepts. Automaton has 27490 states and 96576 transitions. Word has length 3 [2019-12-27 17:49:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:52,276 INFO L462 AbstractCegarLoop]: Abstraction has 27490 states and 96576 transitions. [2019-12-27 17:49:52,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:49:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 27490 states and 96576 transitions. [2019-12-27 17:49:52,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:49:52,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:52,283 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:49:52,283 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:52,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:52,283 INFO L82 PathProgramCache]: Analyzing trace with hash -272589760, now seen corresponding path program 1 times [2019-12-27 17:49:52,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:52,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107468258] [2019-12-27 17:49:52,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:49:52,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107468258] [2019-12-27 17:49:52,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:52,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:49:52,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1936188320] [2019-12-27 17:49:52,376 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:52,378 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:52,380 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:49:52,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:52,381 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:49:52,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:49:52,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:52,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:49:52,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:49:52,383 INFO L87 Difference]: Start difference. First operand 27490 states and 96576 transitions. Second operand 3 states. [2019-12-27 17:49:52,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:52,458 INFO L93 Difference]: Finished difference Result 3269 states and 8037 transitions. [2019-12-27 17:49:52,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:49:52,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 17:49:52,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:52,478 INFO L225 Difference]: With dead ends: 3269 [2019-12-27 17:49:52,478 INFO L226 Difference]: Without dead ends: 3269 [2019-12-27 17:49:52,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:49:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2019-12-27 17:49:52,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3269. [2019-12-27 17:49:52,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3269 states. [2019-12-27 17:49:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 8037 transitions. [2019-12-27 17:49:52,569 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 8037 transitions. Word has length 11 [2019-12-27 17:49:52,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:52,569 INFO L462 AbstractCegarLoop]: Abstraction has 3269 states and 8037 transitions. [2019-12-27 17:49:52,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:49:52,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 8037 transitions. [2019-12-27 17:49:52,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:49:52,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:52,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:49:52,576 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:52,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:52,577 INFO L82 PathProgramCache]: Analyzing trace with hash 295368792, now seen corresponding path program 1 times [2019-12-27 17:49:52,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:52,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961242115] [2019-12-27 17:49:52,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:49:52,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961242115] [2019-12-27 17:49:52,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:52,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:49:52,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [73292638] [2019-12-27 17:49:52,709 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:52,711 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:52,713 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 17:49:52,713 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:52,713 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:49:52,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:49:52,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:52,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:49:52,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:49:52,715 INFO L87 Difference]: Start difference. First operand 3269 states and 8037 transitions. Second operand 4 states. [2019-12-27 17:49:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:52,991 INFO L93 Difference]: Finished difference Result 4313 states and 10392 transitions. [2019-12-27 17:49:52,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:49:52,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 17:49:52,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:53,003 INFO L225 Difference]: With dead ends: 4313 [2019-12-27 17:49:53,004 INFO L226 Difference]: Without dead ends: 4313 [2019-12-27 17:49:53,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:49:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2019-12-27 17:49:53,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4245. [2019-12-27 17:49:53,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4245 states. [2019-12-27 17:49:53,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4245 states to 4245 states and 10260 transitions. [2019-12-27 17:49:53,108 INFO L78 Accepts]: Start accepts. Automaton has 4245 states and 10260 transitions. Word has length 14 [2019-12-27 17:49:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:53,110 INFO L462 AbstractCegarLoop]: Abstraction has 4245 states and 10260 transitions. [2019-12-27 17:49:53,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:49:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 4245 states and 10260 transitions. [2019-12-27 17:49:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 17:49:53,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:53,112 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:49:53,112 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:53,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:53,113 INFO L82 PathProgramCache]: Analyzing trace with hash 566526596, now seen corresponding path program 1 times [2019-12-27 17:49:53,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:53,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136474361] [2019-12-27 17:49:53,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:49:53,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136474361] [2019-12-27 17:49:53,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:53,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:49:53,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [679145192] [2019-12-27 17:49:53,202 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:53,204 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:53,275 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 17:49:53,275 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:53,275 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:49:53,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:49:53,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:53,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:49:53,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:49:53,277 INFO L87 Difference]: Start difference. First operand 4245 states and 10260 transitions. Second operand 3 states. [2019-12-27 17:49:53,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:53,362 INFO L93 Difference]: Finished difference Result 7552 states and 17381 transitions. [2019-12-27 17:49:53,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:49:53,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 17:49:53,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:53,384 INFO L225 Difference]: With dead ends: 7552 [2019-12-27 17:49:53,385 INFO L226 Difference]: Without dead ends: 7552 [2019-12-27 17:49:53,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:49:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7552 states. [2019-12-27 17:49:53,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7552 to 6526. [2019-12-27 17:49:53,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6526 states. [2019-12-27 17:49:53,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6526 states to 6526 states and 15257 transitions. [2019-12-27 17:49:53,517 INFO L78 Accepts]: Start accepts. Automaton has 6526 states and 15257 transitions. Word has length 15 [2019-12-27 17:49:53,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:53,518 INFO L462 AbstractCegarLoop]: Abstraction has 6526 states and 15257 transitions. [2019-12-27 17:49:53,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:49:53,518 INFO L276 IsEmpty]: Start isEmpty. Operand 6526 states and 15257 transitions. [2019-12-27 17:49:53,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:49:53,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:53,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:49:53,520 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:53,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:53,520 INFO L82 PathProgramCache]: Analyzing trace with hash -759251224, now seen corresponding path program 1 times [2019-12-27 17:49:53,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:53,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805118263] [2019-12-27 17:49:53,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:53,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:49:53,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805118263] [2019-12-27 17:49:53,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:53,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:49:53,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [290285349] [2019-12-27 17:49:53,572 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:53,574 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:53,576 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 17:49:53,577 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:53,577 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:49:53,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:49:53,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:53,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:49:53,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:49:53,578 INFO L87 Difference]: Start difference. First operand 6526 states and 15257 transitions. Second operand 4 states. [2019-12-27 17:49:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:53,867 INFO L93 Difference]: Finished difference Result 7957 states and 18351 transitions. [2019-12-27 17:49:53,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:49:53,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 17:49:53,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:53,885 INFO L225 Difference]: With dead ends: 7957 [2019-12-27 17:49:53,886 INFO L226 Difference]: Without dead ends: 7957 [2019-12-27 17:49:53,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:49:53,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7957 states. [2019-12-27 17:49:53,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7957 to 6579. [2019-12-27 17:49:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6579 states. [2019-12-27 17:49:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6579 states to 6579 states and 15368 transitions. [2019-12-27 17:49:54,011 INFO L78 Accepts]: Start accepts. Automaton has 6579 states and 15368 transitions. Word has length 17 [2019-12-27 17:49:54,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:54,011 INFO L462 AbstractCegarLoop]: Abstraction has 6579 states and 15368 transitions. [2019-12-27 17:49:54,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:49:54,012 INFO L276 IsEmpty]: Start isEmpty. Operand 6579 states and 15368 transitions. [2019-12-27 17:49:54,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:49:54,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:54,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:49:54,017 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:54,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:54,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1258171186, now seen corresponding path program 1 times [2019-12-27 17:49:54,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:54,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588724357] [2019-12-27 17:49:54,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:49:54,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588724357] [2019-12-27 17:49:54,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:54,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:49:54,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [480731300] [2019-12-27 17:49:54,084 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:54,089 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:54,095 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:49:54,095 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:54,096 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:49:54,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:49:54,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:54,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:49:54,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:49:54,097 INFO L87 Difference]: Start difference. First operand 6579 states and 15368 transitions. Second operand 5 states. [2019-12-27 17:49:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:54,544 INFO L93 Difference]: Finished difference Result 8876 states and 20253 transitions. [2019-12-27 17:49:54,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:49:54,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 17:49:54,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:54,558 INFO L225 Difference]: With dead ends: 8876 [2019-12-27 17:49:54,558 INFO L226 Difference]: Without dead ends: 8876 [2019-12-27 17:49:54,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-27 17:49:54,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8876 states. [2019-12-27 17:49:54,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8876 to 8439. [2019-12-27 17:49:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8439 states. [2019-12-27 17:49:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8439 states to 8439 states and 19387 transitions. [2019-12-27 17:49:54,735 INFO L78 Accepts]: Start accepts. Automaton has 8439 states and 19387 transitions. Word has length 27 [2019-12-27 17:49:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:54,736 INFO L462 AbstractCegarLoop]: Abstraction has 8439 states and 19387 transitions. [2019-12-27 17:49:54,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:49:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 8439 states and 19387 transitions. [2019-12-27 17:49:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 17:49:54,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:54,743 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] [2019-12-27 17:49:54,743 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:54,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:54,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1366134434, now seen corresponding path program 1 times [2019-12-27 17:49:54,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:54,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781536295] [2019-12-27 17:49:54,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:49:54,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781536295] [2019-12-27 17:49:54,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:54,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:49:54,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1913831319] [2019-12-27 17:49:54,787 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:54,792 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:54,887 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 30 transitions. [2019-12-27 17:49:54,888 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:54,888 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:49:54,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:49:54,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:54,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:49:54,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:49:54,889 INFO L87 Difference]: Start difference. First operand 8439 states and 19387 transitions. Second operand 3 states. [2019-12-27 17:49:54,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:54,976 INFO L93 Difference]: Finished difference Result 9584 states and 20860 transitions. [2019-12-27 17:49:54,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:49:54,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 17:49:54,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:54,988 INFO L225 Difference]: With dead ends: 9584 [2019-12-27 17:49:54,988 INFO L226 Difference]: Without dead ends: 9584 [2019-12-27 17:49:54,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:49:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9584 states. [2019-12-27 17:49:55,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9584 to 8440. [2019-12-27 17:49:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8440 states. [2019-12-27 17:49:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8440 states to 8440 states and 18504 transitions. [2019-12-27 17:49:55,146 INFO L78 Accepts]: Start accepts. Automaton has 8440 states and 18504 transitions. Word has length 30 [2019-12-27 17:49:55,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:55,147 INFO L462 AbstractCegarLoop]: Abstraction has 8440 states and 18504 transitions. [2019-12-27 17:49:55,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:49:55,147 INFO L276 IsEmpty]: Start isEmpty. Operand 8440 states and 18504 transitions. [2019-12-27 17:49:55,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:49:55,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:55,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:49:55,159 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:55,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:55,159 INFO L82 PathProgramCache]: Analyzing trace with hash -736726388, now seen corresponding path program 1 times [2019-12-27 17:49:55,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:55,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558167374] [2019-12-27 17:49:55,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:55,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:49:55,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558167374] [2019-12-27 17:49:55,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:55,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:49:55,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1936657722] [2019-12-27 17:49:55,233 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:55,239 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:55,247 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 33 transitions. [2019-12-27 17:49:55,247 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:55,248 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:49:55,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:49:55,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:55,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:49:55,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:49:55,249 INFO L87 Difference]: Start difference. First operand 8440 states and 18504 transitions. Second operand 5 states. [2019-12-27 17:49:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:55,662 INFO L93 Difference]: Finished difference Result 9537 states and 20673 transitions. [2019-12-27 17:49:55,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:49:55,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 17:49:55,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:55,672 INFO L225 Difference]: With dead ends: 9537 [2019-12-27 17:49:55,672 INFO L226 Difference]: Without dead ends: 9537 [2019-12-27 17:49:55,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:49:55,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9537 states. [2019-12-27 17:49:55,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9537 to 7558. [2019-12-27 17:49:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7558 states. [2019-12-27 17:49:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7558 states to 7558 states and 16717 transitions. [2019-12-27 17:49:55,815 INFO L78 Accepts]: Start accepts. Automaton has 7558 states and 16717 transitions. Word has length 33 [2019-12-27 17:49:55,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:55,816 INFO L462 AbstractCegarLoop]: Abstraction has 7558 states and 16717 transitions. [2019-12-27 17:49:55,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:49:55,816 INFO L276 IsEmpty]: Start isEmpty. Operand 7558 states and 16717 transitions. [2019-12-27 17:49:55,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 17:49:55,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:55,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:49:55,831 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:55,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:55,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1616999435, now seen corresponding path program 1 times [2019-12-27 17:49:55,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:55,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000699718] [2019-12-27 17:49:55,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:49:55,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000699718] [2019-12-27 17:49:55,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:55,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:49:55,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1470814082] [2019-12-27 17:49:55,903 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:55,914 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:55,930 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 39 transitions. [2019-12-27 17:49:55,931 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:55,931 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:49:55,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:49:55,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:55,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:49:55,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:49:55,933 INFO L87 Difference]: Start difference. First operand 7558 states and 16717 transitions. Second operand 4 states. [2019-12-27 17:49:55,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:55,973 INFO L93 Difference]: Finished difference Result 5263 states and 11555 transitions. [2019-12-27 17:49:55,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:49:55,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 17:49:55,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:55,982 INFO L225 Difference]: With dead ends: 5263 [2019-12-27 17:49:55,983 INFO L226 Difference]: Without dead ends: 5263 [2019-12-27 17:49:55,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:49:56,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2019-12-27 17:49:56,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5159. [2019-12-27 17:49:56,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5159 states. [2019-12-27 17:49:56,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 11362 transitions. [2019-12-27 17:49:56,096 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 11362 transitions. Word has length 39 [2019-12-27 17:49:56,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:56,097 INFO L462 AbstractCegarLoop]: Abstraction has 5159 states and 11362 transitions. [2019-12-27 17:49:56,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:49:56,097 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 11362 transitions. [2019-12-27 17:49:56,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 17:49:56,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:56,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:49:56,109 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:56,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:56,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1602567421, now seen corresponding path program 1 times [2019-12-27 17:49:56,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:56,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885036581] [2019-12-27 17:49:56,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:49:56,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885036581] [2019-12-27 17:49:56,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:56,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:49:56,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1818968819] [2019-12-27 17:49:56,301 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:56,326 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:56,435 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 264 transitions. [2019-12-27 17:49:56,436 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:56,606 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 17:49:56,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:49:56,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:56,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:49:56,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:49:56,607 INFO L87 Difference]: Start difference. First operand 5159 states and 11362 transitions. Second operand 12 states. [2019-12-27 17:49:57,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:57,201 INFO L93 Difference]: Finished difference Result 9824 states and 21398 transitions. [2019-12-27 17:49:57,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 17:49:57,201 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-27 17:49:57,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:57,211 INFO L225 Difference]: With dead ends: 9824 [2019-12-27 17:49:57,212 INFO L226 Difference]: Without dead ends: 8719 [2019-12-27 17:49:57,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:49:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8719 states. [2019-12-27 17:49:57,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8719 to 6443. [2019-12-27 17:49:57,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6443 states. [2019-12-27 17:49:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6443 states to 6443 states and 14388 transitions. [2019-12-27 17:49:57,339 INFO L78 Accepts]: Start accepts. Automaton has 6443 states and 14388 transitions. Word has length 68 [2019-12-27 17:49:57,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:57,339 INFO L462 AbstractCegarLoop]: Abstraction has 6443 states and 14388 transitions. [2019-12-27 17:49:57,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:49:57,340 INFO L276 IsEmpty]: Start isEmpty. Operand 6443 states and 14388 transitions. [2019-12-27 17:49:57,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 17:49:57,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:57,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:49:57,355 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:57,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:57,355 INFO L82 PathProgramCache]: Analyzing trace with hash -544831189, now seen corresponding path program 2 times [2019-12-27 17:49:57,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:57,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583727374] [2019-12-27 17:49:57,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:49:57,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583727374] [2019-12-27 17:49:57,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:57,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:49:57,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [140622070] [2019-12-27 17:49:57,462 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:57,485 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:57,785 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 299 transitions. [2019-12-27 17:49:57,786 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:57,831 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:49:57,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:49:57,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:57,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:49:57,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:49:57,832 INFO L87 Difference]: Start difference. First operand 6443 states and 14388 transitions. Second operand 7 states. [2019-12-27 17:49:57,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:57,988 INFO L93 Difference]: Finished difference Result 9381 states and 20893 transitions. [2019-12-27 17:49:57,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:49:57,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-27 17:49:57,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:57,998 INFO L225 Difference]: With dead ends: 9381 [2019-12-27 17:49:57,998 INFO L226 Difference]: Without dead ends: 7879 [2019-12-27 17:49:57,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:49:58,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7879 states. [2019-12-27 17:49:58,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7879 to 7779. [2019-12-27 17:49:58,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7779 states. [2019-12-27 17:49:58,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7779 states to 7779 states and 17459 transitions. [2019-12-27 17:49:58,122 INFO L78 Accepts]: Start accepts. Automaton has 7779 states and 17459 transitions. Word has length 68 [2019-12-27 17:49:58,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:58,122 INFO L462 AbstractCegarLoop]: Abstraction has 7779 states and 17459 transitions. [2019-12-27 17:49:58,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:49:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 7779 states and 17459 transitions. [2019-12-27 17:49:58,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 17:49:58,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:58,139 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:49:58,139 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:58,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:58,140 INFO L82 PathProgramCache]: Analyzing trace with hash 402951891, now seen corresponding path program 3 times [2019-12-27 17:49:58,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:58,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743536234] [2019-12-27 17:49:58,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:49:58,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743536234] [2019-12-27 17:49:58,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:58,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:49:58,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1817300476] [2019-12-27 17:49:58,261 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:58,284 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:59,062 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 344 transitions. [2019-12-27 17:49:59,062 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:59,106 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:49:59,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:49:59,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:59,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:49:59,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:49:59,108 INFO L87 Difference]: Start difference. First operand 7779 states and 17459 transitions. Second operand 10 states. [2019-12-27 17:49:59,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:59,631 INFO L93 Difference]: Finished difference Result 11922 states and 26443 transitions. [2019-12-27 17:49:59,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 17:49:59,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2019-12-27 17:49:59,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:59,644 INFO L225 Difference]: With dead ends: 11922 [2019-12-27 17:49:59,644 INFO L226 Difference]: Without dead ends: 11455 [2019-12-27 17:49:59,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:49:59,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11455 states. [2019-12-27 17:49:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11455 to 7833. [2019-12-27 17:49:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7833 states. [2019-12-27 17:49:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7833 states to 7833 states and 17576 transitions. [2019-12-27 17:49:59,796 INFO L78 Accepts]: Start accepts. Automaton has 7833 states and 17576 transitions. Word has length 68 [2019-12-27 17:49:59,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:59,797 INFO L462 AbstractCegarLoop]: Abstraction has 7833 states and 17576 transitions. [2019-12-27 17:49:59,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:49:59,797 INFO L276 IsEmpty]: Start isEmpty. Operand 7833 states and 17576 transitions. [2019-12-27 17:49:59,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 17:49:59,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:59,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:49:59,814 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:59,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:59,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1969468459, now seen corresponding path program 4 times [2019-12-27 17:49:59,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:59,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246302048] [2019-12-27 17:49:59,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:59,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:49:59,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246302048] [2019-12-27 17:49:59,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:59,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:49:59,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2082951634] [2019-12-27 17:49:59,879 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:59,925 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:00,051 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 264 transitions. [2019-12-27 17:50:00,052 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:00,069 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:50:00,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:50:00,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:00,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:50:00,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:50:00,070 INFO L87 Difference]: Start difference. First operand 7833 states and 17576 transitions. Second operand 5 states. [2019-12-27 17:50:00,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:00,193 INFO L93 Difference]: Finished difference Result 8882 states and 19761 transitions. [2019-12-27 17:50:00,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:50:00,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-27 17:50:00,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:00,195 INFO L225 Difference]: With dead ends: 8882 [2019-12-27 17:50:00,195 INFO L226 Difference]: Without dead ends: 1067 [2019-12-27 17:50:00,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:50:00,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2019-12-27 17:50:00,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 890. [2019-12-27 17:50:00,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-12-27 17:50:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1849 transitions. [2019-12-27 17:50:00,210 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1849 transitions. Word has length 68 [2019-12-27 17:50:00,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:00,210 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1849 transitions. [2019-12-27 17:50:00,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:50:00,210 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1849 transitions. [2019-12-27 17:50:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 17:50:00,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:00,213 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:00,213 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:00,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:00,213 INFO L82 PathProgramCache]: Analyzing trace with hash 26038562, now seen corresponding path program 1 times [2019-12-27 17:50:00,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:00,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090159377] [2019-12-27 17:50:00,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:50:00,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090159377] [2019-12-27 17:50:00,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:00,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:50:00,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2136679947] [2019-12-27 17:50:00,335 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:00,356 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:00,532 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 304 transitions. [2019-12-27 17:50:00,532 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:00,542 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:50:00,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:50:00,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:00,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:50:00,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:50:00,543 INFO L87 Difference]: Start difference. First operand 890 states and 1849 transitions. Second operand 4 states. [2019-12-27 17:50:00,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:00,615 INFO L93 Difference]: Finished difference Result 1011 states and 2091 transitions. [2019-12-27 17:50:00,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:50:00,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-27 17:50:00,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:00,617 INFO L225 Difference]: With dead ends: 1011 [2019-12-27 17:50:00,617 INFO L226 Difference]: Without dead ends: 1011 [2019-12-27 17:50:00,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:50:00,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2019-12-27 17:50:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 923. [2019-12-27 17:50:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2019-12-27 17:50:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1915 transitions. [2019-12-27 17:50:00,628 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1915 transitions. Word has length 69 [2019-12-27 17:50:00,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:00,629 INFO L462 AbstractCegarLoop]: Abstraction has 923 states and 1915 transitions. [2019-12-27 17:50:00,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:50:00,629 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1915 transitions. [2019-12-27 17:50:00,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 17:50:00,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:00,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:00,631 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:00,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:00,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1660504883, now seen corresponding path program 1 times [2019-12-27 17:50:00,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:00,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556382388] [2019-12-27 17:50:00,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:50:00,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556382388] [2019-12-27 17:50:00,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:00,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 17:50:00,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1317128472] [2019-12-27 17:50:00,924 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:00,946 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:01,036 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 213 transitions. [2019-12-27 17:50:01,037 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:01,239 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 17:50:01,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 17:50:01,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:01,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 17:50:01,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:50:01,241 INFO L87 Difference]: Start difference. First operand 923 states and 1915 transitions. Second operand 16 states. [2019-12-27 17:50:02,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:02,911 INFO L93 Difference]: Finished difference Result 1717 states and 3337 transitions. [2019-12-27 17:50:02,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:50:02,912 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 70 [2019-12-27 17:50:02,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:02,915 INFO L225 Difference]: With dead ends: 1717 [2019-12-27 17:50:02,915 INFO L226 Difference]: Without dead ends: 1693 [2019-12-27 17:50:02,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2019-12-27 17:50:02,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2019-12-27 17:50:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1224. [2019-12-27 17:50:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2019-12-27 17:50:02,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 2452 transitions. [2019-12-27 17:50:02,934 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 2452 transitions. Word has length 70 [2019-12-27 17:50:02,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:02,934 INFO L462 AbstractCegarLoop]: Abstraction has 1224 states and 2452 transitions. [2019-12-27 17:50:02,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 17:50:02,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 2452 transitions. [2019-12-27 17:50:02,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 17:50:02,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:02,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:02,937 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:02,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:02,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1810533721, now seen corresponding path program 2 times [2019-12-27 17:50:02,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:02,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009840342] [2019-12-27 17:50:02,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:50:03,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009840342] [2019-12-27 17:50:03,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:03,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:50:03,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [711222404] [2019-12-27 17:50:03,020 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:03,043 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:03,179 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 232 transitions. [2019-12-27 17:50:03,179 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:03,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:50:03,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:50:03,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:03,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:50:03,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:50:03,180 INFO L87 Difference]: Start difference. First operand 1224 states and 2452 transitions. Second operand 3 states. [2019-12-27 17:50:03,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:03,191 INFO L93 Difference]: Finished difference Result 1224 states and 2451 transitions. [2019-12-27 17:50:03,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:50:03,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-27 17:50:03,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:03,193 INFO L225 Difference]: With dead ends: 1224 [2019-12-27 17:50:03,193 INFO L226 Difference]: Without dead ends: 1224 [2019-12-27 17:50:03,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:50:03,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-12-27 17:50:03,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1116. [2019-12-27 17:50:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2019-12-27 17:50:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 2251 transitions. [2019-12-27 17:50:03,203 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 2251 transitions. Word has length 70 [2019-12-27 17:50:03,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:03,203 INFO L462 AbstractCegarLoop]: Abstraction has 1116 states and 2251 transitions. [2019-12-27 17:50:03,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:50:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 2251 transitions. [2019-12-27 17:50:03,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 17:50:03,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:03,205 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:03,205 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:03,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:03,206 INFO L82 PathProgramCache]: Analyzing trace with hash 477046829, now seen corresponding path program 1 times [2019-12-27 17:50:03,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:03,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88719512] [2019-12-27 17:50:03,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:50:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:50:03,338 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:50:03,339 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:50:03,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~main$tmp_guard0~0_19 0) (= v_~main$tmp_guard1~0_73 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1721~0.base_51| 1)) (= 0 v_~x~0_344) (= 0 v_~x$w_buff0_used~0_997) (= 0 |v_ULTIMATE.start_main_~#t1721~0.offset_32|) (= 0 v_~__unbuffered_p0_EAX~0_106) (= 0 v_~x$w_buff1~0_221) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1721~0.base_51|) (= v_~y~0_54 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff0_thd0~0_190 0) (= 0 v_~x$w_buff0~0_234) (= 0 v_~x$mem_tmp~0_169) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_599 0) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_106 0) (= v_~x$r_buff1_thd0~0_225 0) (= 0 v_~x$w_buff1_used~0_499) (= |v_#NULL.offset_5| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1721~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1721~0.base_51|) |v_ULTIMATE.start_main_~#t1721~0.offset_32| 0)) |v_#memory_int_17|) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd2~0_403) (= v_~x$r_buff1_thd1~0_379 0) (= v_~x$flush_delayed~0_191 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1721~0.base_51|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1721~0.base_51| 4) |v_#length_17|) (= v_~weak$$choice2~0_254 0) (= 0 v_~__unbuffered_cnt~0_72) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= 0 v_~x$r_buff1_thd2~0_320))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_234, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_599, ~x$flush_delayed~0=v_~x$flush_delayed~0_191, ULTIMATE.start_main_~#t1721~0.offset=|v_ULTIMATE.start_main_~#t1721~0.offset_32|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_147|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_379, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_73, ~x$mem_tmp~0=v_~x$mem_tmp~0_169, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, #length=|v_#length_17|, ~y~0=v_~y~0_54, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_190, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ULTIMATE.start_main_~#t1722~0.offset=|v_ULTIMATE.start_main_~#t1722~0.offset_18|, ~x$w_buff1~0=v_~x$w_buff1~0_221, ULTIMATE.start_main_~#t1722~0.base=|v_ULTIMATE.start_main_~#t1722~0.base_23|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_225, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_403, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_997, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1721~0.base=|v_ULTIMATE.start_main_~#t1721~0.base_51|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~x~0=v_~x~0_344, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1721~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1722~0.offset, ~x$w_buff1~0, ULTIMATE.start_main_~#t1722~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet61, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1721~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 17:50:03,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1722~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1722~0.base_11| 1)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1722~0.base_11| 4)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1722~0.base_11|) 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1722~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1722~0.base_11|) |v_ULTIMATE.start_main_~#t1722~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t1722~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t1722~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1722~0.offset=|v_ULTIMATE.start_main_~#t1722~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1722~0.base=|v_ULTIMATE.start_main_~#t1722~0.base_11|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1722~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1722~0.base, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-27 17:50:03,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= ~weak$$choice2~0_Out-999005357 |P0Thread1of1ForFork1_#t~nondet4_In-999005357|) (= ~x$flush_delayed~0_Out-999005357 ~weak$$choice2~0_Out-999005357) (= 1 ~x$r_buff0_thd1~0_Out-999005357) (= ~weak$$choice0~0_Out-999005357 |P0Thread1of1ForFork1_#t~nondet3_In-999005357|) (= ~x$r_buff1_thd0~0_Out-999005357 ~x$r_buff0_thd0~0_In-999005357) (= ~x$r_buff1_thd1~0_Out-999005357 ~x$r_buff0_thd1~0_In-999005357) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-999005357 0)) (= ~x~0_In-999005357 ~x$mem_tmp~0_Out-999005357) (= ~x$r_buff1_thd2~0_Out-999005357 ~x$r_buff0_thd2~0_In-999005357)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-999005357, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-999005357, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-999005357, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In-999005357|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-999005357, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In-999005357|, ~x~0=~x~0_In-999005357} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-999005357, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-999005357, ~x$flush_delayed~0=~x$flush_delayed~0_Out-999005357, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-999005357, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-999005357, ~x$mem_tmp~0=~x$mem_tmp~0_Out-999005357, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-999005357, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-999005357, ~weak$$choice0~0=~weak$$choice0~0_Out-999005357, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-999005357, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out-999005357|, ~weak$$choice2~0=~weak$$choice2~0_Out-999005357, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out-999005357|, ~x~0=~x~0_In-999005357} AuxVars[] AssignedVars[~weak$$choice0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~nondet3, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] because there is no mapped edge [2019-12-27 17:50:03,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L744-2-->L744-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-298056552 256))) (.cse2 (= |P0Thread1of1ForFork1_#t~ite5_Out-298056552| |P0Thread1of1ForFork1_#t~ite6_Out-298056552|)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-298056552 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P0Thread1of1ForFork1_#t~ite5_Out-298056552| ~x$w_buff1~0_In-298056552)) (and (not .cse1) .cse2 (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-298056552| ~x$w_buff0~0_In-298056552)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-298056552, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-298056552, ~x$w_buff1~0=~x$w_buff1~0_In-298056552, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-298056552} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-298056552, P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-298056552|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-298056552, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-298056552|, ~x$w_buff1~0=~x$w_buff1~0_In-298056552, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-298056552} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 17:50:03,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~x$r_buff0_thd1~0_87 v_~x$r_buff0_thd1~0_86)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_11|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_86, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 17:50:03,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-1225162821 256)))) (or (and (not .cse0) (= ~x$mem_tmp~0_In-1225162821 |P0Thread1of1ForFork1_#t~ite25_Out-1225162821|)) (and .cse0 (= ~x~0_In-1225162821 |P0Thread1of1ForFork1_#t~ite25_Out-1225162821|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1225162821, ~x$mem_tmp~0=~x$mem_tmp~0_In-1225162821, ~x~0=~x~0_In-1225162821} OutVars{P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out-1225162821|, ~x$flush_delayed~0=~x$flush_delayed~0_In-1225162821, ~x$mem_tmp~0=~x$mem_tmp~0_In-1225162821, ~x~0=~x~0_In-1225162821} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 17:50:03,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-349014931 256) 0))) (or (and (= ~x$mem_tmp~0_In-349014931 |P1Thread1of1ForFork0_#t~ite54_Out-349014931|) (not .cse0)) (and (= |P1Thread1of1ForFork0_#t~ite54_Out-349014931| ~x~0_In-349014931) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-349014931, ~x$mem_tmp~0=~x$mem_tmp~0_In-349014931, ~x~0=~x~0_In-349014931} OutVars{P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-349014931|, ~x$flush_delayed~0=~x$flush_delayed~0_In-349014931, ~x$mem_tmp~0=~x$mem_tmp~0_In-349014931, ~x~0=~x~0_In-349014931} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 17:50:03,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In1866248783 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1866248783 256)))) (or (and (= ~x~0_In1866248783 |P1Thread1of1ForFork0_#t~ite55_Out1866248783|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In1866248783 |P1Thread1of1ForFork0_#t~ite55_Out1866248783|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1866248783, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1866248783, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1866248783, ~x~0=~x~0_In1866248783} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1866248783, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1866248783, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1866248783, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out1866248783|, ~x~0=~x~0_In1866248783} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-27 17:50:03,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~x~0_77 |v_P1Thread1of1ForFork0_#t~ite55_10|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_10|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_13|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_9|, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~x~0] because there is no mapped edge [2019-12-27 17:50:03,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In537369579 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In537369579 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite57_Out537369579|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite57_Out537369579| ~x$w_buff0_used~0_In537369579)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In537369579, ~x$w_buff0_used~0=~x$w_buff0_used~0_In537369579} OutVars{P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out537369579|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In537369579, ~x$w_buff0_used~0=~x$w_buff0_used~0_In537369579} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-27 17:50:03,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L797-->L797-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-370541874 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-370541874 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-370541874 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-370541874 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite58_Out-370541874| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-370541874 |P1Thread1of1ForFork0_#t~ite58_Out-370541874|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-370541874, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-370541874, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-370541874, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-370541874} OutVars{P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out-370541874|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-370541874, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-370541874, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-370541874, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-370541874} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-27 17:50:03,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In578626061 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In578626061 256)))) (or (and (= ~x$r_buff0_thd2~0_In578626061 |P1Thread1of1ForFork0_#t~ite59_Out578626061|) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite59_Out578626061| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In578626061, ~x$w_buff0_used~0=~x$w_buff0_used~0_In578626061} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In578626061, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out578626061|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In578626061} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-27 17:50:03,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-593071586 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-593071586 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-593071586 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-593071586 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite60_Out-593071586| ~x$r_buff1_thd2~0_In-593071586)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite60_Out-593071586| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-593071586, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-593071586, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-593071586, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-593071586} OutVars{P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-593071586|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-593071586, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-593071586, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-593071586, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-593071586} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-27 17:50:03,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_36|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_192, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 17:50:03,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1033002257 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1033002257 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite28_Out-1033002257| ~x$w_buff0_used~0_In-1033002257)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite28_Out-1033002257| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1033002257, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1033002257} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1033002257, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out-1033002257|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1033002257} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 17:50:03,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L761-->L761-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd1~0_In-200385959 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-200385959 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-200385959 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-200385959 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite29_Out-200385959| ~x$w_buff1_used~0_In-200385959) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork1_#t~ite29_Out-200385959|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-200385959, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-200385959, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-200385959, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-200385959} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-200385959, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out-200385959|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-200385959, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-200385959, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-200385959} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 17:50:03,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L762-->L763: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1570242837 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1570242837 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In-1570242837 ~x$r_buff0_thd1~0_Out-1570242837) (or .cse0 .cse1)) (and (= ~x$r_buff0_thd1~0_Out-1570242837 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1570242837, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1570242837} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1570242837, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out-1570242837|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1570242837} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 17:50:03,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In460068743 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In460068743 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In460068743 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In460068743 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite31_Out460068743|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite31_Out460068743| ~x$r_buff1_thd1~0_In460068743)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In460068743, ~x$w_buff1_used~0=~x$w_buff1_used~0_In460068743, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In460068743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In460068743} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In460068743, ~x$w_buff1_used~0=~x$w_buff1_used~0_In460068743, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In460068743, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out460068743|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In460068743} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 17:50:03,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_36|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_36|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_35|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 17:50:03,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 2 v_~__unbuffered_cnt~0_18)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 17:50:03,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L826-2-->L826-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1815615804 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1815615804 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite63_Out1815615804| |ULTIMATE.start_main_#t~ite64_Out1815615804|))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out1815615804| ~x~0_In1815615804) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) .cse2 (= |ULTIMATE.start_main_#t~ite63_Out1815615804| ~x$w_buff1~0_In1815615804)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1815615804, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1815615804, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1815615804, ~x~0=~x~0_In1815615804} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1815615804|, ~x$w_buff1~0=~x$w_buff1~0_In1815615804, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1815615804, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1815615804, ~x~0=~x~0_In1815615804, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1815615804|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-27 17:50:03,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-79280589 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-79280589 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-79280589 |ULTIMATE.start_main_#t~ite65_Out-79280589|)) (and (= 0 |ULTIMATE.start_main_#t~ite65_Out-79280589|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-79280589, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-79280589} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-79280589, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-79280589|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-79280589} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-27 17:50:03,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L828-->L828-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In1915756991 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1915756991 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1915756991 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1915756991 256) 0))) (or (and (= ~x$w_buff1_used~0_In1915756991 |ULTIMATE.start_main_#t~ite66_Out1915756991|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite66_Out1915756991|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1915756991, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1915756991, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1915756991, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1915756991} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1915756991, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1915756991, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out1915756991|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1915756991, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1915756991} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-27 17:50:03,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1147638287 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1147638287 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite67_Out1147638287| ~x$r_buff0_thd0~0_In1147638287)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite67_Out1147638287| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1147638287, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1147638287} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1147638287, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out1147638287|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1147638287} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-27 17:50:03,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1012] [1012] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In361084041 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In361084041 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In361084041 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In361084041 256)))) (or (and (= ~x$r_buff1_thd0~0_In361084041 |ULTIMATE.start_main_#t~ite68_Out361084041|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite68_Out361084041|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In361084041, ~x$w_buff1_used~0=~x$w_buff1_used~0_In361084041, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In361084041, ~x$w_buff0_used~0=~x$w_buff0_used~0_In361084041} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In361084041, ~x$w_buff1_used~0=~x$w_buff1_used~0_In361084041, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out361084041|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In361084041, ~x$w_buff0_used~0=~x$w_buff0_used~0_In361084041} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-27 17:50:03,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~x$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_83|) (= 1 v_~__unbuffered_p1_EAX~0_73) (= v_~__unbuffered_p0_EBX~0_47 0) (= v_~__unbuffered_p1_EBX~0_62 0) (= v_~main$tmp_guard1~0_40 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_83|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:50:03,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:50:03 BasicIcfg [2019-12-27 17:50:03,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:50:03,506 INFO L168 Benchmark]: Toolchain (without parser) took 24441.59 ms. Allocated memory was 146.3 MB in the beginning and 1.1 GB in the end (delta: 975.2 MB). Free memory was 102.2 MB in the beginning and 564.0 MB in the end (delta: -461.8 MB). Peak memory consumption was 513.4 MB. Max. memory is 7.1 GB. [2019-12-27 17:50:03,507 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 17:50:03,507 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.29 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 156.8 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:50:03,513 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.55 ms. Allocated memory is still 203.9 MB. Free memory was 156.8 MB in the beginning and 153.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:50:03,514 INFO L168 Benchmark]: Boogie Preprocessor took 49.11 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:50:03,515 INFO L168 Benchmark]: RCFGBuilder took 920.01 ms. Allocated memory is still 203.9 MB. Free memory was 150.9 MB in the beginning and 94.7 MB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:50:03,516 INFO L168 Benchmark]: TraceAbstraction took 22570.11 ms. Allocated memory was 203.9 MB in the beginning and 1.1 GB in the end (delta: 917.5 MB). Free memory was 94.7 MB in the beginning and 564.0 MB in the end (delta: -469.3 MB). Peak memory consumption was 448.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:50:03,520 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.20 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 814.29 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 156.8 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.55 ms. Allocated memory is still 203.9 MB. Free memory was 156.8 MB in the beginning and 153.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.11 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 920.01 ms. Allocated memory is still 203.9 MB. Free memory was 150.9 MB in the beginning and 94.7 MB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22570.11 ms. Allocated memory was 203.9 MB in the beginning and 1.1 GB in the end (delta: 917.5 MB). Free memory was 94.7 MB in the beginning and 564.0 MB in the end (delta: -469.3 MB). Peak memory consumption was 448.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 191 ProgramPointsBefore, 113 ProgramPointsAfterwards, 246 TransitionsBefore, 136 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 35 ChoiceCompositions, 9685 VarBasedMoverChecksPositive, 320 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 419 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 0 MoverChecksTotal, 146813 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1722, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 x$w_buff1 = x$w_buff0 [L730] 1 x$w_buff0 = 1 [L731] 1 x$w_buff1_used = x$w_buff0_used [L732] 1 x$w_buff0_used = (_Bool)1 [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L746] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L747] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L748] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 [L776] 2 __unbuffered_p1_EAX = y [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 x$flush_delayed = weak$$choice2 [L782] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] 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) [L784] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L785] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L786] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L786] 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)) [L787] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 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)) [L788] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 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) [L791] 2 x = x$flush_delayed ? x$mem_tmp : x [L792] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 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 [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 22.1s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3788 SDtfs, 3785 SDslu, 9777 SDs, 0 SdLazy, 3376 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 62 SyntacticMatches, 13 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29658occurred 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: 3.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 12976 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 741 NumberOfCodeBlocks, 741 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 654 ConstructedInterpolants, 0 QuantifiedInterpolants, 137281 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...