/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:09:18,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:09:18,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:09:18,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:09:18,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:09:18,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:09:18,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:09:18,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:09:18,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:09:18,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:09:18,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:09:18,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:09:18,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:09:18,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:09:18,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:09:18,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:09:18,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:09:18,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:09:18,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:09:18,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:09:18,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:09:18,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:09:18,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:09:18,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:09:18,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:09:18,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:09:18,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:09:18,947 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:09:18,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:09:18,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:09:18,949 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:09:18,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:09:18,950 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:09:18,951 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:09:18,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:09:18,952 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:09:18,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:09:18,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:09:18,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:09:18,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:09:18,955 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:09:18,956 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 05:09:18,970 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:09:18,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:09:18,972 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:09:18,972 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:09:18,972 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:09:18,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:09:18,973 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:09:18,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:09:18,973 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:09:18,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:09:18,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:09:18,974 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:09:18,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:09:18,974 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:09:18,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:09:18,974 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:09:18,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:09:18,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:09:18,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:09:18,975 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:09:18,975 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:09:18,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:09:18,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:09:18,976 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:09:18,976 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:09:18,976 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:09:18,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:09:18,977 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:09:18,977 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:09:18,977 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:09:19,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:09:19,268 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:09:19,273 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:09:19,275 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:09:19,275 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:09:19,277 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_rmo.opt.i [2019-12-27 05:09:19,347 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6275258f6/442cd4819ad247c3bd7033ea55c8219e/FLAGc7c2f8476 [2019-12-27 05:09:19,937 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:09:19,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_rmo.opt.i [2019-12-27 05:09:19,956 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6275258f6/442cd4819ad247c3bd7033ea55c8219e/FLAGc7c2f8476 [2019-12-27 05:09:20,218 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6275258f6/442cd4819ad247c3bd7033ea55c8219e [2019-12-27 05:09:20,228 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:09:20,230 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:09:20,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:09:20,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:09:20,235 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:09:20,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:09:20" (1/1) ... [2019-12-27 05:09:20,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5be7c6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:20, skipping insertion in model container [2019-12-27 05:09:20,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:09:20" (1/1) ... [2019-12-27 05:09:20,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:09:20,306 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:09:20,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:09:20,876 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:09:20,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:09:21,051 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:09:21,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:21 WrapperNode [2019-12-27 05:09:21,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:09:21,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:09:21,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:09:21,053 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:09:21,060 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:09:21" (1/1) ... [2019-12-27 05:09:21,082 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:09:21" (1/1) ... [2019-12-27 05:09:21,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:09:21,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:09:21,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:09:21,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:09:21,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:21" (1/1) ... [2019-12-27 05:09:21,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:21" (1/1) ... [2019-12-27 05:09:21,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:21" (1/1) ... [2019-12-27 05:09:21,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:21" (1/1) ... [2019-12-27 05:09:21,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:21" (1/1) ... [2019-12-27 05:09:21,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:21" (1/1) ... [2019-12-27 05:09:21,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:21" (1/1) ... [2019-12-27 05:09:21,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:09:21,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:09:21,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:09:21,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:09:21,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:21" (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 05:09:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:09:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:09:21,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:09:21,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:09:21,251 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:09:21,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:09:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:09:21,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:09:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:09:21,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:09:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 05:09:21,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 05:09:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:09:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:09:21,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:09:21,256 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 05:09:22,119 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:09:22,120 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:09:22,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:09:22 BoogieIcfgContainer [2019-12-27 05:09:22,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:09:22,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:09:22,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:09:22,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:09:22,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:09:20" (1/3) ... [2019-12-27 05:09:22,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4c552c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:09:22, skipping insertion in model container [2019-12-27 05:09:22,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:21" (2/3) ... [2019-12-27 05:09:22,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4c552c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:09:22, skipping insertion in model container [2019-12-27 05:09:22,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:09:22" (3/3) ... [2019-12-27 05:09:22,149 INFO L109 eAbstractionObserver]: Analyzing ICFG mix005_rmo.opt.i [2019-12-27 05:09:22,160 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:09:22,161 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:09:22,175 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:09:22,177 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:09:22,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,244 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,244 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,252 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,252 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,291 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,292 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,292 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,292 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,292 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,292 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,293 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,294 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,294 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,309 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,310 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,310 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,310 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,310 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,312 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,312 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,312 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,312 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,317 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,317 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,317 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,317 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,317 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,318 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,318 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,318 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,318 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,318 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,318 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,319 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,319 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,319 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,320 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,320 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,326 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,327 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,327 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,327 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,327 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,328 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,328 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,329 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,333 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,339 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,339 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,350 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,352 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,357 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,357 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,358 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,358 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,358 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,358 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,358 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,358 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,359 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,359 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,359 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,359 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,359 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,359 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,360 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,360 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,360 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,360 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,360 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,360 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,361 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,361 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,361 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,361 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,361 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,361 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,363 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,363 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,363 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,367 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,368 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:09:22,384 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 05:09:22,407 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:09:22,407 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:09:22,408 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:09:22,408 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:09:22,408 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:09:22,408 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:09:22,408 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:09:22,408 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:09:22,434 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-27 05:09:22,435 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-27 05:09:22,562 INFO L132 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-27 05:09:22,562 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:09:22,580 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 559 event pairs. 0/193 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-27 05:09:22,612 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-27 05:09:22,684 INFO L132 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-27 05:09:22,684 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:09:22,698 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 559 event pairs. 0/193 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-27 05:09:22,735 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-27 05:09:22,736 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:09:26,164 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-12-27 05:09:26,561 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 05:09:26,707 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 05:09:27,040 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 05:09:27,204 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 05:09:27,236 INFO L206 etLargeBlockEncoding]: Checked pairs total: 148368 [2019-12-27 05:09:27,236 INFO L214 etLargeBlockEncoding]: Total number of compositions: 129 [2019-12-27 05:09:27,239 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 115 places, 135 transitions [2019-12-27 05:09:37,821 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 93038 states. [2019-12-27 05:09:37,823 INFO L276 IsEmpty]: Start isEmpty. Operand 93038 states. [2019-12-27 05:09:37,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 05:09:37,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:09:37,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:09:37,832 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:09:37,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:09:37,837 INFO L82 PathProgramCache]: Analyzing trace with hash -219848509, now seen corresponding path program 1 times [2019-12-27 05:09:37,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:09:37,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374814546] [2019-12-27 05:09:37,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:09:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:09:38,179 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 05:09:38,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374814546] [2019-12-27 05:09:38,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:09:38,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:09:38,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237536619] [2019-12-27 05:09:38,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:09:38,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:09:38,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:09:38,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:09:38,206 INFO L87 Difference]: Start difference. First operand 93038 states. Second operand 3 states. [2019-12-27 05:09:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:09:41,836 INFO L93 Difference]: Finished difference Result 92046 states and 422416 transitions. [2019-12-27 05:09:41,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:09:41,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 05:09:41,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:09:42,408 INFO L225 Difference]: With dead ends: 92046 [2019-12-27 05:09:42,408 INFO L226 Difference]: Without dead ends: 85710 [2019-12-27 05:09:42,409 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 05:09:44,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85710 states. [2019-12-27 05:09:49,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85710 to 85710. [2019-12-27 05:09:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85710 states. [2019-12-27 05:09:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85710 states to 85710 states and 393088 transitions. [2019-12-27 05:09:49,663 INFO L78 Accepts]: Start accepts. Automaton has 85710 states and 393088 transitions. Word has length 9 [2019-12-27 05:09:49,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:09:49,664 INFO L462 AbstractCegarLoop]: Abstraction has 85710 states and 393088 transitions. [2019-12-27 05:09:49,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:09:49,664 INFO L276 IsEmpty]: Start isEmpty. Operand 85710 states and 393088 transitions. [2019-12-27 05:09:49,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 05:09:49,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:09:49,672 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:09:49,673 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:09:49,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:09:49,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1999056324, now seen corresponding path program 1 times [2019-12-27 05:09:49,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:09:49,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526123180] [2019-12-27 05:09:49,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:09:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:09:49,779 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 05:09:49,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526123180] [2019-12-27 05:09:49,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:09:49,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:09:49,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045424182] [2019-12-27 05:09:49,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:09:49,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:09:49,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:09:49,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:09:49,782 INFO L87 Difference]: Start difference. First operand 85710 states and 393088 transitions. Second operand 4 states. [2019-12-27 05:09:54,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:09:54,048 INFO L93 Difference]: Finished difference Result 135910 states and 601052 transitions. [2019-12-27 05:09:54,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:09:54,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 05:09:54,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:09:54,814 INFO L225 Difference]: With dead ends: 135910 [2019-12-27 05:09:54,814 INFO L226 Difference]: Without dead ends: 135838 [2019-12-27 05:09:54,815 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 05:09:56,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135838 states. [2019-12-27 05:09:59,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135838 to 132030. [2019-12-27 05:09:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132030 states. [2019-12-27 05:10:05,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132030 states to 132030 states and 587252 transitions. [2019-12-27 05:10:05,632 INFO L78 Accepts]: Start accepts. Automaton has 132030 states and 587252 transitions. Word has length 15 [2019-12-27 05:10:05,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:10:05,632 INFO L462 AbstractCegarLoop]: Abstraction has 132030 states and 587252 transitions. [2019-12-27 05:10:05,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:10:05,632 INFO L276 IsEmpty]: Start isEmpty. Operand 132030 states and 587252 transitions. [2019-12-27 05:10:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 05:10:05,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:10:05,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:10:05,642 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:10:05,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:10:05,642 INFO L82 PathProgramCache]: Analyzing trace with hash 960194978, now seen corresponding path program 1 times [2019-12-27 05:10:05,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:10:05,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051369512] [2019-12-27 05:10:05,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:10:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:10:05,766 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 05:10:05,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051369512] [2019-12-27 05:10:05,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:10:05,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:10:05,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221957435] [2019-12-27 05:10:05,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:10:05,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:10:05,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:10:05,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:10:05,772 INFO L87 Difference]: Start difference. First operand 132030 states and 587252 transitions. Second operand 4 states. [2019-12-27 05:10:08,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:10:08,076 INFO L93 Difference]: Finished difference Result 167330 states and 735532 transitions. [2019-12-27 05:10:08,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:10:08,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 05:10:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:10:14,278 INFO L225 Difference]: With dead ends: 167330 [2019-12-27 05:10:14,278 INFO L226 Difference]: Without dead ends: 167270 [2019-12-27 05:10:14,279 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 05:10:16,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167270 states. [2019-12-27 05:10:19,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167270 to 149078. [2019-12-27 05:10:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149078 states. [2019-12-27 05:10:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149078 states to 149078 states and 660916 transitions. [2019-12-27 05:10:19,986 INFO L78 Accepts]: Start accepts. Automaton has 149078 states and 660916 transitions. Word has length 18 [2019-12-27 05:10:19,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:10:19,987 INFO L462 AbstractCegarLoop]: Abstraction has 149078 states and 660916 transitions. [2019-12-27 05:10:19,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:10:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 149078 states and 660916 transitions. [2019-12-27 05:10:20,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 05:10:20,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:10:20,004 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] [2019-12-27 05:10:20,005 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:10:20,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:10:20,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1006978459, now seen corresponding path program 1 times [2019-12-27 05:10:20,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:10:20,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831957261] [2019-12-27 05:10:20,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:10:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:10:20,087 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 05:10:20,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831957261] [2019-12-27 05:10:20,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:10:20,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:10:20,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262018089] [2019-12-27 05:10:20,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:10:20,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:10:20,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:10:20,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:10:20,090 INFO L87 Difference]: Start difference. First operand 149078 states and 660916 transitions. Second operand 3 states. [2019-12-27 05:10:21,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:10:21,884 INFO L93 Difference]: Finished difference Result 145939 states and 643818 transitions. [2019-12-27 05:10:21,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:10:21,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 05:10:21,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:10:22,366 INFO L225 Difference]: With dead ends: 145939 [2019-12-27 05:10:22,367 INFO L226 Difference]: Without dead ends: 145939 [2019-12-27 05:10:22,367 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 05:10:25,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145939 states. [2019-12-27 05:10:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145939 to 145939. [2019-12-27 05:10:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145939 states. [2019-12-27 05:10:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145939 states to 145939 states and 643818 transitions. [2019-12-27 05:10:36,625 INFO L78 Accepts]: Start accepts. Automaton has 145939 states and 643818 transitions. Word has length 20 [2019-12-27 05:10:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:10:36,625 INFO L462 AbstractCegarLoop]: Abstraction has 145939 states and 643818 transitions. [2019-12-27 05:10:36,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:10:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 145939 states and 643818 transitions. [2019-12-27 05:10:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 05:10:36,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:10:36,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:10:36,644 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:10:36,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:10:36,644 INFO L82 PathProgramCache]: Analyzing trace with hash -776205731, now seen corresponding path program 1 times [2019-12-27 05:10:36,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:10:36,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907308475] [2019-12-27 05:10:36,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:10:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:10:36,700 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 05:10:36,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907308475] [2019-12-27 05:10:36,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:10:36,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:10:36,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598470488] [2019-12-27 05:10:36,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:10:36,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:10:36,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:10:36,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:10:36,702 INFO L87 Difference]: Start difference. First operand 145939 states and 643818 transitions. Second operand 3 states. [2019-12-27 05:10:37,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:10:37,606 INFO L93 Difference]: Finished difference Result 180068 states and 754679 transitions. [2019-12-27 05:10:37,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:10:37,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 05:10:37,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:10:44,279 INFO L225 Difference]: With dead ends: 180068 [2019-12-27 05:10:44,279 INFO L226 Difference]: Without dead ends: 146514 [2019-12-27 05:10:44,279 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 05:10:45,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146514 states. [2019-12-27 05:10:48,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146514 to 143325. [2019-12-27 05:10:48,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143325 states. [2019-12-27 05:10:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143325 states to 143325 states and 597576 transitions. [2019-12-27 05:10:48,895 INFO L78 Accepts]: Start accepts. Automaton has 143325 states and 597576 transitions. Word has length 21 [2019-12-27 05:10:48,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:10:48,896 INFO L462 AbstractCegarLoop]: Abstraction has 143325 states and 597576 transitions. [2019-12-27 05:10:48,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:10:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 143325 states and 597576 transitions. [2019-12-27 05:10:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 05:10:48,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:10:48,910 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] [2019-12-27 05:10:48,910 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:10:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:10:48,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1300239832, now seen corresponding path program 1 times [2019-12-27 05:10:48,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:10:48,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785231271] [2019-12-27 05:10:48,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:10:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:10:48,965 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 05:10:48,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785231271] [2019-12-27 05:10:48,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:10:48,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:10:48,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123706880] [2019-12-27 05:10:48,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:10:48,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:10:48,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:10:48,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:10:48,968 INFO L87 Difference]: Start difference. First operand 143325 states and 597576 transitions. Second operand 3 states. [2019-12-27 05:10:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:10:50,653 INFO L93 Difference]: Finished difference Result 143151 states and 596933 transitions. [2019-12-27 05:10:50,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:10:50,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 05:10:50,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:10:51,102 INFO L225 Difference]: With dead ends: 143151 [2019-12-27 05:10:51,102 INFO L226 Difference]: Without dead ends: 143151 [2019-12-27 05:10:51,102 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 05:10:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143151 states. [2019-12-27 05:11:00,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143151 to 143151. [2019-12-27 05:11:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143151 states. [2019-12-27 05:11:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143151 states to 143151 states and 596933 transitions. [2019-12-27 05:11:01,760 INFO L78 Accepts]: Start accepts. Automaton has 143151 states and 596933 transitions. Word has length 21 [2019-12-27 05:11:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:01,760 INFO L462 AbstractCegarLoop]: Abstraction has 143151 states and 596933 transitions. [2019-12-27 05:11:01,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:11:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 143151 states and 596933 transitions. [2019-12-27 05:11:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:11:01,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:01,778 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:01,778 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:01,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:01,779 INFO L82 PathProgramCache]: Analyzing trace with hash -338694234, now seen corresponding path program 1 times [2019-12-27 05:11:01,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:01,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673936295] [2019-12-27 05:11:01,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:01,826 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 05:11:01,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673936295] [2019-12-27 05:11:01,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:01,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:11:01,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451030446] [2019-12-27 05:11:01,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:11:01,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:01,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:11:01,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:11:01,829 INFO L87 Difference]: Start difference. First operand 143151 states and 596933 transitions. Second operand 4 states. [2019-12-27 05:11:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:02,764 INFO L93 Difference]: Finished difference Result 210250 states and 827736 transitions. [2019-12-27 05:11:02,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:11:02,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-27 05:11:02,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:08,973 INFO L225 Difference]: With dead ends: 210250 [2019-12-27 05:11:08,973 INFO L226 Difference]: Without dead ends: 79302 [2019-12-27 05:11:08,974 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 05:11:09,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79302 states. [2019-12-27 05:11:10,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79302 to 78186. [2019-12-27 05:11:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78186 states. [2019-12-27 05:11:11,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78186 states to 78186 states and 272476 transitions. [2019-12-27 05:11:11,069 INFO L78 Accepts]: Start accepts. Automaton has 78186 states and 272476 transitions. Word has length 22 [2019-12-27 05:11:11,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:11,069 INFO L462 AbstractCegarLoop]: Abstraction has 78186 states and 272476 transitions. [2019-12-27 05:11:11,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:11:11,069 INFO L276 IsEmpty]: Start isEmpty. Operand 78186 states and 272476 transitions. [2019-12-27 05:11:11,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:11:11,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:11,078 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:11,078 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:11,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:11,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1675693570, now seen corresponding path program 2 times [2019-12-27 05:11:11,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:11,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266092717] [2019-12-27 05:11:11,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:11:11,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266092717] [2019-12-27 05:11:11,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:11,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:11:11,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948631494] [2019-12-27 05:11:11,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:11:11,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:11,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:11:11,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:11:11,120 INFO L87 Difference]: Start difference. First operand 78186 states and 272476 transitions. Second operand 3 states. [2019-12-27 05:11:11,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:11,535 INFO L93 Difference]: Finished difference Result 73900 states and 255147 transitions. [2019-12-27 05:11:11,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:11:11,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-27 05:11:11,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:11,755 INFO L225 Difference]: With dead ends: 73900 [2019-12-27 05:11:11,755 INFO L226 Difference]: Without dead ends: 73684 [2019-12-27 05:11:11,755 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 05:11:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73684 states. [2019-12-27 05:11:13,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73684 to 73468. [2019-12-27 05:11:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73468 states. [2019-12-27 05:11:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73468 states to 73468 states and 253875 transitions. [2019-12-27 05:11:14,137 INFO L78 Accepts]: Start accepts. Automaton has 73468 states and 253875 transitions. Word has length 22 [2019-12-27 05:11:14,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:14,137 INFO L462 AbstractCegarLoop]: Abstraction has 73468 states and 253875 transitions. [2019-12-27 05:11:14,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:11:14,137 INFO L276 IsEmpty]: Start isEmpty. Operand 73468 states and 253875 transitions. [2019-12-27 05:11:14,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 05:11:14,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:14,150 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] [2019-12-27 05:11:14,150 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:14,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:14,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2098624475, now seen corresponding path program 1 times [2019-12-27 05:11:14,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:14,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286715512] [2019-12-27 05:11:14,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:14,250 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 05:11:14,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286715512] [2019-12-27 05:11:14,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:14,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:11:14,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288175111] [2019-12-27 05:11:14,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:11:14,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:14,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:11:14,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:11:14,252 INFO L87 Difference]: Start difference. First operand 73468 states and 253875 transitions. Second operand 5 states. [2019-12-27 05:11:15,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:15,783 INFO L93 Difference]: Finished difference Result 87478 states and 296814 transitions. [2019-12-27 05:11:15,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:11:15,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 05:11:15,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:15,973 INFO L225 Difference]: With dead ends: 87478 [2019-12-27 05:11:15,974 INFO L226 Difference]: Without dead ends: 85842 [2019-12-27 05:11:15,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:11:16,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85842 states. [2019-12-27 05:11:18,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85842 to 71222. [2019-12-27 05:11:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71222 states. [2019-12-27 05:11:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71222 states to 71222 states and 245537 transitions. [2019-12-27 05:11:18,379 INFO L78 Accepts]: Start accepts. Automaton has 71222 states and 245537 transitions. Word has length 24 [2019-12-27 05:11:18,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:18,379 INFO L462 AbstractCegarLoop]: Abstraction has 71222 states and 245537 transitions. [2019-12-27 05:11:18,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:11:18,379 INFO L276 IsEmpty]: Start isEmpty. Operand 71222 states and 245537 transitions. [2019-12-27 05:11:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 05:11:18,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:18,449 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] [2019-12-27 05:11:18,449 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:18,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:18,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1881257346, now seen corresponding path program 1 times [2019-12-27 05:11:18,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:18,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275465623] [2019-12-27 05:11:18,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:18,512 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 05:11:18,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275465623] [2019-12-27 05:11:18,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:18,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:11:18,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010037580] [2019-12-27 05:11:18,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:11:18,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:18,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:11:18,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:11:18,515 INFO L87 Difference]: Start difference. First operand 71222 states and 245537 transitions. Second operand 3 states. [2019-12-27 05:11:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:18,901 INFO L93 Difference]: Finished difference Result 71222 states and 242269 transitions. [2019-12-27 05:11:18,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:11:18,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-27 05:11:18,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:19,060 INFO L225 Difference]: With dead ends: 71222 [2019-12-27 05:11:19,060 INFO L226 Difference]: Without dead ends: 71222 [2019-12-27 05:11:19,060 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 05:11:19,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71222 states. [2019-12-27 05:11:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71222 to 71046. [2019-12-27 05:11:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71046 states. [2019-12-27 05:11:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71046 states to 71046 states and 241801 transitions. [2019-12-27 05:11:21,239 INFO L78 Accepts]: Start accepts. Automaton has 71046 states and 241801 transitions. Word has length 36 [2019-12-27 05:11:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:21,239 INFO L462 AbstractCegarLoop]: Abstraction has 71046 states and 241801 transitions. [2019-12-27 05:11:21,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:11:21,239 INFO L276 IsEmpty]: Start isEmpty. Operand 71046 states and 241801 transitions. [2019-12-27 05:11:21,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 05:11:21,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:21,301 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] [2019-12-27 05:11:21,301 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:21,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:21,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1678028845, now seen corresponding path program 1 times [2019-12-27 05:11:21,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:21,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122225486] [2019-12-27 05:11:21,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:21,412 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 05:11:21,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122225486] [2019-12-27 05:11:21,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:21,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:11:21,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130973736] [2019-12-27 05:11:21,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:11:21,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:21,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:11:21,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:11:21,415 INFO L87 Difference]: Start difference. First operand 71046 states and 241801 transitions. Second operand 7 states. [2019-12-27 05:11:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:23,279 INFO L93 Difference]: Finished difference Result 181532 states and 617388 transitions. [2019-12-27 05:11:23,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 05:11:23,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-27 05:11:23,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:23,610 INFO L225 Difference]: With dead ends: 181532 [2019-12-27 05:11:23,610 INFO L226 Difference]: Without dead ends: 149624 [2019-12-27 05:11:23,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-27 05:11:24,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149624 states. [2019-12-27 05:11:27,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149624 to 115350. [2019-12-27 05:11:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115350 states. [2019-12-27 05:11:28,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115350 states to 115350 states and 398708 transitions. [2019-12-27 05:11:28,136 INFO L78 Accepts]: Start accepts. Automaton has 115350 states and 398708 transitions. Word has length 37 [2019-12-27 05:11:28,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:28,137 INFO L462 AbstractCegarLoop]: Abstraction has 115350 states and 398708 transitions. [2019-12-27 05:11:28,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:11:28,137 INFO L276 IsEmpty]: Start isEmpty. Operand 115350 states and 398708 transitions. [2019-12-27 05:11:28,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 05:11:28,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:28,259 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] [2019-12-27 05:11:28,259 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:28,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:28,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1355430725, now seen corresponding path program 2 times [2019-12-27 05:11:28,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:28,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391020868] [2019-12-27 05:11:28,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:28,388 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 05:11:28,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391020868] [2019-12-27 05:11:28,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:28,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:11:28,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107248150] [2019-12-27 05:11:28,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:11:28,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:28,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:11:28,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:11:28,391 INFO L87 Difference]: Start difference. First operand 115350 states and 398708 transitions. Second operand 9 states. [2019-12-27 05:11:31,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:31,000 INFO L93 Difference]: Finished difference Result 222258 states and 767982 transitions. [2019-12-27 05:11:31,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 05:11:31,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-27 05:11:31,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:31,474 INFO L225 Difference]: With dead ends: 222258 [2019-12-27 05:11:31,474 INFO L226 Difference]: Without dead ends: 210146 [2019-12-27 05:11:31,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2019-12-27 05:11:32,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210146 states. [2019-12-27 05:11:36,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210146 to 117812. [2019-12-27 05:11:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117812 states. [2019-12-27 05:11:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117812 states to 117812 states and 407680 transitions. [2019-12-27 05:11:36,911 INFO L78 Accepts]: Start accepts. Automaton has 117812 states and 407680 transitions. Word has length 37 [2019-12-27 05:11:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:36,912 INFO L462 AbstractCegarLoop]: Abstraction has 117812 states and 407680 transitions. [2019-12-27 05:11:36,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:11:36,912 INFO L276 IsEmpty]: Start isEmpty. Operand 117812 states and 407680 transitions. [2019-12-27 05:11:37,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 05:11:37,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:37,036 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] [2019-12-27 05:11:37,036 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:37,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:37,036 INFO L82 PathProgramCache]: Analyzing trace with hash -335825104, now seen corresponding path program 1 times [2019-12-27 05:11:37,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:37,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622496996] [2019-12-27 05:11:37,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:37,120 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 05:11:37,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622496996] [2019-12-27 05:11:37,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:37,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:11:37,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806142962] [2019-12-27 05:11:37,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:11:37,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:37,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:11:37,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:11:37,122 INFO L87 Difference]: Start difference. First operand 117812 states and 407680 transitions. Second operand 5 states. [2019-12-27 05:11:37,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:37,461 INFO L93 Difference]: Finished difference Result 69623 states and 232957 transitions. [2019-12-27 05:11:37,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:11:37,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-27 05:11:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:37,576 INFO L225 Difference]: With dead ends: 69623 [2019-12-27 05:11:37,576 INFO L226 Difference]: Without dead ends: 62619 [2019-12-27 05:11:37,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:11:38,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62619 states. [2019-12-27 05:11:39,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62619 to 62262. [2019-12-27 05:11:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62262 states. [2019-12-27 05:11:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62262 states to 62262 states and 210246 transitions. [2019-12-27 05:11:39,570 INFO L78 Accepts]: Start accepts. Automaton has 62262 states and 210246 transitions. Word has length 38 [2019-12-27 05:11:39,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:39,570 INFO L462 AbstractCegarLoop]: Abstraction has 62262 states and 210246 transitions. [2019-12-27 05:11:39,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:11:39,570 INFO L276 IsEmpty]: Start isEmpty. Operand 62262 states and 210246 transitions. [2019-12-27 05:11:39,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:11:39,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:39,634 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 05:11:39,634 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:39,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:39,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1018558760, now seen corresponding path program 1 times [2019-12-27 05:11:39,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:39,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319156278] [2019-12-27 05:11:39,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:39,732 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 05:11:39,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319156278] [2019-12-27 05:11:39,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:39,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:11:39,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139566379] [2019-12-27 05:11:39,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:11:39,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:39,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:11:39,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:11:39,734 INFO L87 Difference]: Start difference. First operand 62262 states and 210246 transitions. Second operand 6 states. [2019-12-27 05:11:39,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:39,869 INFO L93 Difference]: Finished difference Result 11769 states and 33393 transitions. [2019-12-27 05:11:39,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:11:39,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-27 05:11:39,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:39,888 INFO L225 Difference]: With dead ends: 11769 [2019-12-27 05:11:39,888 INFO L226 Difference]: Without dead ends: 8214 [2019-12-27 05:11:39,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:11:39,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8214 states. [2019-12-27 05:11:40,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8214 to 7845. [2019-12-27 05:11:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7845 states. [2019-12-27 05:11:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7845 states to 7845 states and 19861 transitions. [2019-12-27 05:11:40,040 INFO L78 Accepts]: Start accepts. Automaton has 7845 states and 19861 transitions. Word has length 39 [2019-12-27 05:11:40,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:40,042 INFO L462 AbstractCegarLoop]: Abstraction has 7845 states and 19861 transitions. [2019-12-27 05:11:40,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:11:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 7845 states and 19861 transitions. [2019-12-27 05:11:40,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 05:11:40,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:40,052 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] [2019-12-27 05:11:40,053 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:40,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:40,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1807974181, now seen corresponding path program 1 times [2019-12-27 05:11:40,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:40,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536581764] [2019-12-27 05:11:40,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:40,123 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 05:11:40,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536581764] [2019-12-27 05:11:40,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:40,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:11:40,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64145513] [2019-12-27 05:11:40,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:11:40,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:40,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:11:40,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:11:40,125 INFO L87 Difference]: Start difference. First operand 7845 states and 19861 transitions. Second operand 4 states. [2019-12-27 05:11:40,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:40,167 INFO L93 Difference]: Finished difference Result 8807 states and 22056 transitions. [2019-12-27 05:11:40,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:11:40,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-27 05:11:40,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:40,179 INFO L225 Difference]: With dead ends: 8807 [2019-12-27 05:11:40,179 INFO L226 Difference]: Without dead ends: 7567 [2019-12-27 05:11:40,183 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 05:11:40,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7567 states. [2019-12-27 05:11:40,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7567 to 7549. [2019-12-27 05:11:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7549 states. [2019-12-27 05:11:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7549 states to 7549 states and 19128 transitions. [2019-12-27 05:11:40,335 INFO L78 Accepts]: Start accepts. Automaton has 7549 states and 19128 transitions. Word has length 50 [2019-12-27 05:11:40,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:40,335 INFO L462 AbstractCegarLoop]: Abstraction has 7549 states and 19128 transitions. [2019-12-27 05:11:40,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:11:40,335 INFO L276 IsEmpty]: Start isEmpty. Operand 7549 states and 19128 transitions. [2019-12-27 05:11:40,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 05:11:40,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:40,342 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] [2019-12-27 05:11:40,342 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:40,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:40,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1074177589, now seen corresponding path program 2 times [2019-12-27 05:11:40,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:40,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300427474] [2019-12-27 05:11:40,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:40,437 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 05:11:40,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300427474] [2019-12-27 05:11:40,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:40,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:11:40,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834276270] [2019-12-27 05:11:40,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:11:40,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:40,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:11:40,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:11:40,439 INFO L87 Difference]: Start difference. First operand 7549 states and 19128 transitions. Second operand 7 states. [2019-12-27 05:11:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:40,557 INFO L93 Difference]: Finished difference Result 6395 states and 16501 transitions. [2019-12-27 05:11:40,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:11:40,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-27 05:11:40,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:40,558 INFO L225 Difference]: With dead ends: 6395 [2019-12-27 05:11:40,558 INFO L226 Difference]: Without dead ends: 508 [2019-12-27 05:11:40,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:11:40,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-12-27 05:11:40,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2019-12-27 05:11:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-12-27 05:11:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1119 transitions. [2019-12-27 05:11:40,566 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1119 transitions. Word has length 50 [2019-12-27 05:11:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:40,567 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 1119 transitions. [2019-12-27 05:11:40,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:11:40,567 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1119 transitions. [2019-12-27 05:11:40,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:11:40,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:40,568 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:40,568 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:40,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:40,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1499988210, now seen corresponding path program 1 times [2019-12-27 05:11:40,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:40,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517841849] [2019-12-27 05:11:40,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:40,668 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 05:11:40,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517841849] [2019-12-27 05:11:40,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:40,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:11:40,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535963070] [2019-12-27 05:11:40,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:11:40,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:40,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:11:40,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:11:40,670 INFO L87 Difference]: Start difference. First operand 508 states and 1119 transitions. Second operand 8 states. [2019-12-27 05:11:40,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:40,917 INFO L93 Difference]: Finished difference Result 1039 states and 2246 transitions. [2019-12-27 05:11:40,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:11:40,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 05:11:40,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:40,919 INFO L225 Difference]: With dead ends: 1039 [2019-12-27 05:11:40,919 INFO L226 Difference]: Without dead ends: 764 [2019-12-27 05:11:40,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:11:40,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-12-27 05:11:40,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 608. [2019-12-27 05:11:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-12-27 05:11:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1300 transitions. [2019-12-27 05:11:40,929 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1300 transitions. Word has length 66 [2019-12-27 05:11:40,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:40,929 INFO L462 AbstractCegarLoop]: Abstraction has 608 states and 1300 transitions. [2019-12-27 05:11:40,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:11:40,929 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1300 transitions. [2019-12-27 05:11:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:11:40,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:40,930 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:40,930 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:40,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:40,931 INFO L82 PathProgramCache]: Analyzing trace with hash 719111176, now seen corresponding path program 2 times [2019-12-27 05:11:40,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:40,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598167686] [2019-12-27 05:11:40,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:11:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:11:41,078 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:11:41,078 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:11:41,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t141~0.base_29| 4)) (= 0 v_~__unbuffered_cnt~0_25) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t141~0.base_29|) (= v_~z$r_buff0_thd1~0_10 0) (= 0 v_~z$w_buff1~0_34) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~a~0_11 0) (= v_~z$w_buff0_used~0_132 0) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~z$r_buff1_thd0~0_21) (= v_~z$r_buff0_thd4~0_77 0) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$r_buff0_thd0~0_21 0) (= v_~z$r_buff0_thd2~0_10 0) (= v_~z$r_buff0_thd3~0_54 0) (= 0 v_~z$r_buff1_thd4~0_38) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$flush_delayed~0_17) (= 0 v_~weak$$choice2~0_36) (= v_~x~0_17 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$w_buff1_used~0_70) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p2_EAX~0_13) (= 0 v_~weak$$choice0~0_11) (= v_~z$r_buff1_thd1~0_9 0) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~z$r_buff1_thd3~0_27) (= v_~main$tmp_guard1~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_14) (= |v_#NULL.offset_4| 0) (= v_~z$mem_tmp~0_12 0) (= 0 v_~__unbuffered_p3_EAX~0_13) (= v_~y~0_11 0) (= 0 v_~z$w_buff0~0_39) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t141~0.base_29| 1)) (= v_~main$tmp_guard0~0_11 0) (= v_~z~0_29 0) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t141~0.base_29| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t141~0.base_29|) |v_ULTIMATE.start_main_~#t141~0.offset_21| 0)) |v_#memory_int_31|) (= (select .cse0 |v_ULTIMATE.start_main_~#t141~0.base_29|) 0) (= 0 |v_ULTIMATE.start_main_~#t141~0.offset_21|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t141~0.offset=|v_ULTIMATE.start_main_~#t141~0.offset_21|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_19|, ~a~0=v_~a~0_11, ULTIMATE.start_main_~#t144~0.base=|v_ULTIMATE.start_main_~#t144~0.base_21|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ULTIMATE.start_main_~#t144~0.offset=|v_ULTIMATE.start_main_~#t144~0.offset_17|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_77, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_13, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ULTIMATE.start_main_~#t141~0.base=|v_ULTIMATE.start_main_~#t141~0.base_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_~#t142~0.base=|v_ULTIMATE.start_main_~#t142~0.base_21|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, ~z$flush_delayed~0=v_~z$flush_delayed~0_17, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_11|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_9, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~x~0=v_~x~0_17, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_38, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ULTIMATE.start_main_~#t143~0.base=|v_ULTIMATE.start_main_~#t143~0.base_20|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_21, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ULTIMATE.start_main_~#t143~0.offset=|v_ULTIMATE.start_main_~#t143~0.offset_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_11|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_14|, ULTIMATE.start_main_~#t142~0.offset=|v_ULTIMATE.start_main_~#t142~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_31|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t141~0.offset, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ULTIMATE.start_main_~#t144~0.base, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t144~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t141~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t142~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t143~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ULTIMATE.start_main_~#t143~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t142~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:11:41,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] L856-1-->L858: Formula: (and (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t142~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t142~0.base_11|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t142~0.base_11| 4)) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t142~0.base_11|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t142~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t142~0.offset_10|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t142~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t142~0.base_11|) |v_ULTIMATE.start_main_~#t142~0.offset_10| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t142~0.offset=|v_ULTIMATE.start_main_~#t142~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t142~0.base=|v_ULTIMATE.start_main_~#t142~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t142~0.offset, ULTIMATE.start_main_~#t142~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 05:11:41,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L858-1-->L860: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t143~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t143~0.base_12| 4)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t143~0.base_12| 1)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t143~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t143~0.base_12|) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t143~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t143~0.base_12|) |v_ULTIMATE.start_main_~#t143~0.offset_11| 2))) (not (= |v_ULTIMATE.start_main_~#t143~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t143~0.base=|v_ULTIMATE.start_main_~#t143~0.base_12|, #length=|v_#length_21|, ULTIMATE.start_main_~#t143~0.offset=|v_ULTIMATE.start_main_~#t143~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t143~0.base, #length, ULTIMATE.start_main_~#t143~0.offset] because there is no mapped edge [2019-12-27 05:11:41,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L860-1-->L862: Formula: (and (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t144~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t144~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t144~0.offset_11|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t144~0.base_13|)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t144~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t144~0.base_13|) |v_ULTIMATE.start_main_~#t144~0.offset_11| 3)) |v_#memory_int_23|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t144~0.base_13| 4) |v_#length_23|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t144~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t144~0.base=|v_ULTIMATE.start_main_~#t144~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t144~0.offset=|v_ULTIMATE.start_main_~#t144~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t144~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, ULTIMATE.start_main_~#t144~0.offset, #length] because there is no mapped edge [2019-12-27 05:11:41,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_23 v_~z$w_buff1~0_18) (= 1 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|) (= v_~z$w_buff0_used~0_91 1) (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= 1 v_~z$w_buff0~0_22) (= v_~z$w_buff0_used~0_92 v_~z$w_buff1_used~0_51) (= 0 (mod v_~z$w_buff1_used~0_51 256)) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_7 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_23, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_7, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_51, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~z$w_buff1~0=v_~z$w_buff1~0_18, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 05:11:41,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out-1942394814| |P3Thread1of1ForFork2_#t~ite28_Out-1942394814|)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1942394814 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1942394814 256)))) (or (and .cse0 (= ~z$w_buff0~0_In-1942394814 |P3Thread1of1ForFork2_#t~ite28_Out-1942394814|) (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~z$w_buff1~0_In-1942394814 |P3Thread1of1ForFork2_#t~ite28_Out-1942394814|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1942394814, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1942394814, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1942394814, ~z$w_buff1~0=~z$w_buff1~0_In-1942394814} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1942394814|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1942394814|, ~z$w_buff0~0=~z$w_buff0~0_In-1942394814, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1942394814, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1942394814, ~z$w_buff1~0=~z$w_buff1~0_In-1942394814} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 05:11:41,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_29 256))) (= v_~z$r_buff0_thd4~0_51 v_~z$r_buff0_thd4~0_50)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_8|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 05:11:41,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-2006229960 256)))) (or (and (= ~z~0_In-2006229960 |P3Thread1of1ForFork2_#t~ite48_Out-2006229960|) .cse0) (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out-2006229960| ~z$mem_tmp~0_In-2006229960)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-2006229960, ~z$flush_delayed~0=~z$flush_delayed~0_In-2006229960, ~z~0=~z~0_In-2006229960} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-2006229960, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-2006229960|, ~z$flush_delayed~0=~z$flush_delayed~0_In-2006229960, ~z~0=~z~0_In-2006229960} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-27 05:11:41,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1024] [1024] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_P0Thread1of1ForFork3_~arg.base_4 |v_P0Thread1of1ForFork3_#in~arg.base_4|) (= 1 v_~a~0_6) (= |v_P0Thread1of1ForFork3_#in~arg.offset_4| v_P0Thread1of1ForFork3_~arg.offset_4) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= 1 v_~x~0_8)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_4, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_4, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-27 05:11:41,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= 2 v_~x~0_7) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_p1_EAX~0_7 v_~y~0_5)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y~0=v_~y~0_5} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_5, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 05:11:41,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In869522497 256) 0))) (or (and (not .cse0) (= ~z$mem_tmp~0_In869522497 |P2Thread1of1ForFork1_#t~ite25_Out869522497|)) (and .cse0 (= ~z~0_In869522497 |P2Thread1of1ForFork1_#t~ite25_Out869522497|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In869522497, ~z$flush_delayed~0=~z$flush_delayed~0_In869522497, ~z~0=~z~0_In869522497} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In869522497, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out869522497|, ~z$flush_delayed~0=~z$flush_delayed~0_In869522497, ~z~0=~z~0_In869522497} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 05:11:41,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1992475869 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1992475869 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-1992475869|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1992475869 |P3Thread1of1ForFork2_#t~ite51_Out-1992475869|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1992475869, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1992475869} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1992475869|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1992475869, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1992475869} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-27 05:11:41,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1006465774 256))) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1006465774 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-1006465774 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1006465774 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out-1006465774| ~z$w_buff1_used~0_In-1006465774)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-1006465774|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1006465774, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1006465774, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1006465774, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1006465774} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1006465774|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1006465774, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1006465774, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1006465774, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1006465774} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-27 05:11:41,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-563460313 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-563460313 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out-563460313 ~z$r_buff0_thd4~0_In-563460313) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out-563460313) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-563460313, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-563460313} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-563460313|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-563460313, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-563460313} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 05:11:41,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-862799509 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-862799509 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-862799509 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-862799509 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In-862799509 |P3Thread1of1ForFork2_#t~ite54_Out-862799509|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P3Thread1of1ForFork2_#t~ite54_Out-862799509|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-862799509, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-862799509, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-862799509, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-862799509} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-862799509|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-862799509, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-862799509, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-862799509, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-862799509} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-27 05:11:41,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] L837-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite54_8| v_~z$r_buff1_thd4~0_32) (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_7|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_32, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:11:41,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L788-2-->P2EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_13) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~z~0_23 |v_P2Thread1of1ForFork1_#t~ite25_8|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_23, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 05:11:41,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~z$r_buff0_thd0~0_14 256)) (= 0 (mod v_~z$w_buff0_used~0_93 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 05:11:41,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite59_Out569806772| |ULTIMATE.start_main_#t~ite60_Out569806772|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In569806772 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In569806772 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite59_Out569806772| ~z~0_In569806772)) (and .cse2 (not .cse1) (= |ULTIMATE.start_main_#t~ite59_Out569806772| ~z$w_buff1~0_In569806772) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In569806772, ~z$w_buff1_used~0=~z$w_buff1_used~0_In569806772, ~z$w_buff1~0=~z$w_buff1~0_In569806772, ~z~0=~z~0_In569806772} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out569806772|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In569806772, ~z$w_buff1_used~0=~z$w_buff1_used~0_In569806772, ~z$w_buff1~0=~z$w_buff1~0_In569806772, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out569806772|, ~z~0=~z~0_In569806772} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 05:11:41,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1811245884 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1811245884 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1811245884 |ULTIMATE.start_main_#t~ite61_Out1811245884|)) (and (= |ULTIMATE.start_main_#t~ite61_Out1811245884| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1811245884, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1811245884} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1811245884, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1811245884|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1811245884} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 05:11:41,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In1732786922 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In1732786922 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1732786922 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1732786922 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite62_Out1732786922| ~z$w_buff1_used~0_In1732786922)) (and (= |ULTIMATE.start_main_#t~ite62_Out1732786922| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1732786922, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1732786922, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1732786922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1732786922} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1732786922|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1732786922, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1732786922, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1732786922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1732786922} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 05:11:41,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1985730857 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1985730857 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite63_Out1985730857| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite63_Out1985730857| ~z$r_buff0_thd0~0_In1985730857)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1985730857, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1985730857} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1985730857|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1985730857, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1985730857} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 05:11:41,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In293064857 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In293064857 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In293064857 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In293064857 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out293064857| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In293064857 |ULTIMATE.start_main_#t~ite64_Out293064857|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In293064857, ~z$w_buff0_used~0=~z$w_buff0_used~0_In293064857, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In293064857, ~z$w_buff1_used~0=~z$w_buff1_used~0_In293064857} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In293064857, ~z$w_buff0_used~0=~z$w_buff0_used~0_In293064857, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In293064857, ~z$w_buff1_used~0=~z$w_buff1_used~0_In293064857, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out293064857|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-27 05:11:41,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1044] [1044] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_7) (= |v_ULTIMATE.start_main_#t~ite64_11| v_~z$r_buff1_thd0~0_15) (= v_~main$tmp_guard1~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_~__unbuffered_p2_EAX~0_7 1) (= 0 v_~__unbuffered_p3_EBX~0_8) (= v_~x~0_11 2)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_11|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_15, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:11:41,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:11:41 BasicIcfg [2019-12-27 05:11:41,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:11:41,290 INFO L168 Benchmark]: Toolchain (without parser) took 141060.10 ms. Allocated memory was 145.2 MB in the beginning and 4.0 GB in the end (delta: 3.9 GB). Free memory was 101.1 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 05:11:41,290 INFO L168 Benchmark]: CDTParser took 1.76 ms. Allocated memory is still 145.2 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 05:11:41,291 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.64 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.1 MB in the beginning and 154.8 MB in the end (delta: -53.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:11:41,292 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.80 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 151.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:11:41,292 INFO L168 Benchmark]: Boogie Preprocessor took 47.77 ms. Allocated memory is still 202.9 MB. Free memory was 151.9 MB in the beginning and 149.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:11:41,293 INFO L168 Benchmark]: RCFGBuilder took 945.29 ms. Allocated memory is still 202.9 MB. Free memory was 149.0 MB in the beginning and 90.7 MB in the end (delta: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 7.1 GB. [2019-12-27 05:11:41,293 INFO L168 Benchmark]: TraceAbstraction took 139164.85 ms. Allocated memory was 202.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 90.7 MB in the beginning and 2.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 05:11:41,296 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.76 ms. Allocated memory is still 145.2 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 820.64 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.1 MB in the beginning and 154.8 MB in the end (delta: -53.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.80 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 151.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.77 ms. Allocated memory is still 202.9 MB. Free memory was 151.9 MB in the beginning and 149.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 945.29 ms. Allocated memory is still 202.9 MB. Free memory was 149.0 MB in the beginning and 90.7 MB in the end (delta: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 139164.85 ms. Allocated memory was 202.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 90.7 MB in the beginning and 2.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 212 ProgramPointsBefore, 115 ProgramPointsAfterwards, 255 TransitionsBefore, 135 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 47 ConcurrentYvCompositions, 28 ChoiceCompositions, 10757 VarBasedMoverChecksPositive, 248 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 148368 CheckedPairsTotal, 129 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L856] FCALL, FORK 0 pthread_create(&t141, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t142, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t143, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t144, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 [L814] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 4 z$flush_delayed = weak$$choice2 [L817] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L819] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L821] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$flush_delayed ? z$mem_tmp : z [L827] 4 z$flush_delayed = (_Bool)0 [L830] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 __unbuffered_p2_EAX = y [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L781] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L783] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L786] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L871] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 2 error locations. Result: UNSAFE, OverallTime: 138.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 46.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3875 SDtfs, 5357 SDslu, 8053 SDs, 0 SdLazy, 2415 SolverSat, 155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149078occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 74.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 168825 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 591 NumberOfCodeBlocks, 591 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 55988 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...