/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:18:26,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:18:26,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:18:26,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:18:26,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:18:26,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:18:26,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:18:26,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:18:26,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:18:26,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:18:26,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:18:26,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:18:26,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:18:26,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:18:26,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:18:26,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:18:26,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:18:26,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:18:26,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:18:26,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:18:26,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:18:26,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:18:26,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:18:26,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:18:26,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:18:26,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:18:26,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:18:26,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:18:26,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:18:26,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:18:26,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:18:26,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:18:26,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:18:26,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:18:26,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:18:26,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:18:26,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:18:26,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:18:26,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:18:26,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:18:26,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:18:26,221 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:18:26,240 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:18:26,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:18:26,242 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:18:26,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:18:26,242 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:18:26,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:18:26,243 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:18:26,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:18:26,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:18:26,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:18:26,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:18:26,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:18:26,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:18:26,245 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:18:26,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:18:26,245 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:18:26,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:18:26,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:18:26,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:18:26,246 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:18:26,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:18:26,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:18:26,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:18:26,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:18:26,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:18:26,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:18:26,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:18:26,248 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:18:26,248 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:18:26,248 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:18:26,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:18:26,534 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:18:26,537 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:18:26,539 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:18:26,539 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:18:26,540 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_rmo.opt.i [2019-12-26 21:18:26,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/942650f0f/e6cbbe36de0f40188a95d03fa3f498e3/FLAGf15a21db4 [2019-12-26 21:18:27,179 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:18:27,179 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_rmo.opt.i [2019-12-26 21:18:27,198 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/942650f0f/e6cbbe36de0f40188a95d03fa3f498e3/FLAGf15a21db4 [2019-12-26 21:18:27,456 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/942650f0f/e6cbbe36de0f40188a95d03fa3f498e3 [2019-12-26 21:18:27,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:18:27,467 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:18:27,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:18:27,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:18:27,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:18:27,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:18:27" (1/1) ... [2019-12-26 21:18:27,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0780ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:27, skipping insertion in model container [2019-12-26 21:18:27,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:18:27" (1/1) ... [2019-12-26 21:18:27,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:18:27,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:18:28,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:18:28,204 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:18:28,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:18:28,355 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:18:28,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:28 WrapperNode [2019-12-26 21:18:28,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:18:28,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:18:28,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:18:28,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:18:28,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:28" (1/1) ... [2019-12-26 21:18:28,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:28" (1/1) ... [2019-12-26 21:18:28,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:18:28,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:18:28,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:18:28,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:18:28,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:28" (1/1) ... [2019-12-26 21:18:28,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:28" (1/1) ... [2019-12-26 21:18:28,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:28" (1/1) ... [2019-12-26 21:18:28,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:28" (1/1) ... [2019-12-26 21:18:28,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:28" (1/1) ... [2019-12-26 21:18:28,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:28" (1/1) ... [2019-12-26 21:18:28,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:28" (1/1) ... [2019-12-26 21:18:28,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:18:28,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:18:28,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:18:28,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:18:28,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:28" (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-26 21:18:28,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:18:28,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:18:28,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:18:28,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:18:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:18:28,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:18:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:18:28,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:18:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:18:28,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:18:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:18:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:18:28,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:18:28,576 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:18:29,599 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:18:29,599 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:18:29,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:18:29 BoogieIcfgContainer [2019-12-26 21:18:29,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:18:29,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:18:29,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:18:29,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:18:29,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:18:27" (1/3) ... [2019-12-26 21:18:29,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95a260e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:18:29, skipping insertion in model container [2019-12-26 21:18:29,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:28" (2/3) ... [2019-12-26 21:18:29,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95a260e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:18:29, skipping insertion in model container [2019-12-26 21:18:29,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:18:29" (3/3) ... [2019-12-26 21:18:29,616 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_rmo.opt.i [2019-12-26 21:18:29,627 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:18:29,627 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:18:29,638 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:18:29,639 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:18:29,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,724 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,724 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,729 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,729 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,766 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,767 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,767 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,775 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,776 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,810 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,815 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,820 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,827 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,827 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,831 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,833 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:29,849 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:18:29,871 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:18:29,871 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:18:29,872 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:18:29,872 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:18:29,872 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:18:29,872 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:18:29,872 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:18:29,872 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:18:29,891 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 241 transitions [2019-12-26 21:18:29,893 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-26 21:18:30,030 INFO L132 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-26 21:18:30,031 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:18:30,058 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 566 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-26 21:18:30,098 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-26 21:18:30,189 INFO L132 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-26 21:18:30,190 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:18:30,200 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 566 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-26 21:18:30,233 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-26 21:18:30,235 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:18:35,743 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-12-26 21:18:36,044 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-26 21:18:36,160 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-26 21:18:36,236 INFO L206 etLargeBlockEncoding]: Checked pairs total: 128241 [2019-12-26 21:18:36,236 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-26 21:18:36,240 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 110 places, 133 transitions [2019-12-26 21:18:40,497 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 47186 states. [2019-12-26 21:18:40,500 INFO L276 IsEmpty]: Start isEmpty. Operand 47186 states. [2019-12-26 21:18:40,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 21:18:40,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:40,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:18:40,513 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:18:40,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:40,519 INFO L82 PathProgramCache]: Analyzing trace with hash -137140126, now seen corresponding path program 1 times [2019-12-26 21:18:40,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:40,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126613811] [2019-12-26 21:18:40,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:40,784 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-26 21:18:40,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126613811] [2019-12-26 21:18:40,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:40,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:18:40,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212281079] [2019-12-26 21:18:40,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:18:40,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:40,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:18:40,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:18:40,811 INFO L87 Difference]: Start difference. First operand 47186 states. Second operand 3 states. [2019-12-26 21:18:41,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:41,679 INFO L93 Difference]: Finished difference Result 46894 states and 192684 transitions. [2019-12-26 21:18:41,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:18:41,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 21:18:41,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:42,063 INFO L225 Difference]: With dead ends: 46894 [2019-12-26 21:18:42,063 INFO L226 Difference]: Without dead ends: 43674 [2019-12-26 21:18:42,064 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-26 21:18:44,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43674 states. [2019-12-26 21:18:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43674 to 43674. [2019-12-26 21:18:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43674 states. [2019-12-26 21:18:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43674 states to 43674 states and 179330 transitions. [2019-12-26 21:18:45,713 INFO L78 Accepts]: Start accepts. Automaton has 43674 states and 179330 transitions. Word has length 7 [2019-12-26 21:18:45,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:45,714 INFO L462 AbstractCegarLoop]: Abstraction has 43674 states and 179330 transitions. [2019-12-26 21:18:45,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:18:45,714 INFO L276 IsEmpty]: Start isEmpty. Operand 43674 states and 179330 transitions. [2019-12-26 21:18:45,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:18:45,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:45,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:18:45,721 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:18:45,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:45,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1070314357, now seen corresponding path program 1 times [2019-12-26 21:18:45,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:45,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277777391] [2019-12-26 21:18:45,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:45,822 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-26 21:18:45,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277777391] [2019-12-26 21:18:45,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:45,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:18:45,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447800385] [2019-12-26 21:18:45,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:18:45,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:45,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:18:45,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:18:45,826 INFO L87 Difference]: Start difference. First operand 43674 states and 179330 transitions. Second operand 3 states. [2019-12-26 21:18:46,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:46,016 INFO L93 Difference]: Finished difference Result 24545 states and 88296 transitions. [2019-12-26 21:18:46,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:18:46,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:18:46,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:47,831 INFO L225 Difference]: With dead ends: 24545 [2019-12-26 21:18:47,831 INFO L226 Difference]: Without dead ends: 24545 [2019-12-26 21:18:47,835 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-26 21:18:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24545 states. [2019-12-26 21:18:48,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24545 to 24545. [2019-12-26 21:18:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24545 states. [2019-12-26 21:18:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24545 states to 24545 states and 88296 transitions. [2019-12-26 21:18:48,943 INFO L78 Accepts]: Start accepts. Automaton has 24545 states and 88296 transitions. Word has length 13 [2019-12-26 21:18:48,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:48,943 INFO L462 AbstractCegarLoop]: Abstraction has 24545 states and 88296 transitions. [2019-12-26 21:18:48,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:18:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 24545 states and 88296 transitions. [2019-12-26 21:18:48,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 21:18:48,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:48,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:18:48,950 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:18:48,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:48,951 INFO L82 PathProgramCache]: Analyzing trace with hash -933049582, now seen corresponding path program 1 times [2019-12-26 21:18:48,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:48,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070137835] [2019-12-26 21:18:48,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:49,046 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-26 21:18:49,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070137835] [2019-12-26 21:18:49,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:49,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:18:49,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582118081] [2019-12-26 21:18:49,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:18:49,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:49,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:18:49,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:18:49,050 INFO L87 Difference]: Start difference. First operand 24545 states and 88296 transitions. Second operand 4 states. [2019-12-26 21:18:49,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:49,114 INFO L93 Difference]: Finished difference Result 4442 states and 13065 transitions. [2019-12-26 21:18:49,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:18:49,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 21:18:49,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:49,124 INFO L225 Difference]: With dead ends: 4442 [2019-12-26 21:18:49,125 INFO L226 Difference]: Without dead ends: 4442 [2019-12-26 21:18:49,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:18:49,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4442 states. [2019-12-26 21:18:49,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4442 to 4442. [2019-12-26 21:18:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4442 states. [2019-12-26 21:18:49,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4442 states to 4442 states and 13065 transitions. [2019-12-26 21:18:49,217 INFO L78 Accepts]: Start accepts. Automaton has 4442 states and 13065 transitions. Word has length 14 [2019-12-26 21:18:49,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:49,217 INFO L462 AbstractCegarLoop]: Abstraction has 4442 states and 13065 transitions. [2019-12-26 21:18:49,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:18:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 4442 states and 13065 transitions. [2019-12-26 21:18:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:18:49,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:49,220 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:18:49,220 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:18:49,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:49,221 INFO L82 PathProgramCache]: Analyzing trace with hash 484016506, now seen corresponding path program 1 times [2019-12-26 21:18:49,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:49,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31095105] [2019-12-26 21:18:49,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:49,344 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-26 21:18:49,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31095105] [2019-12-26 21:18:49,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:49,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:18:49,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671795341] [2019-12-26 21:18:49,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:18:49,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:49,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:18:49,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:18:49,349 INFO L87 Difference]: Start difference. First operand 4442 states and 13065 transitions. Second operand 4 states. [2019-12-26 21:18:49,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:49,647 INFO L93 Difference]: Finished difference Result 6211 states and 17740 transitions. [2019-12-26 21:18:49,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:18:49,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:18:49,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:49,658 INFO L225 Difference]: With dead ends: 6211 [2019-12-26 21:18:49,658 INFO L226 Difference]: Without dead ends: 6211 [2019-12-26 21:18:49,658 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-26 21:18:49,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6211 states. [2019-12-26 21:18:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6211 to 6115. [2019-12-26 21:18:49,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6115 states. [2019-12-26 21:18:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6115 states to 6115 states and 17563 transitions. [2019-12-26 21:18:49,785 INFO L78 Accepts]: Start accepts. Automaton has 6115 states and 17563 transitions. Word has length 16 [2019-12-26 21:18:49,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:49,786 INFO L462 AbstractCegarLoop]: Abstraction has 6115 states and 17563 transitions. [2019-12-26 21:18:49,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:18:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 6115 states and 17563 transitions. [2019-12-26 21:18:49,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 21:18:49,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:49,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:18:49,789 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:18:49,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:49,790 INFO L82 PathProgramCache]: Analyzing trace with hash 2119638279, now seen corresponding path program 1 times [2019-12-26 21:18:49,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:49,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70487583] [2019-12-26 21:18:49,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:49,828 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-26 21:18:49,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70487583] [2019-12-26 21:18:49,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:49,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:18:49,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479459278] [2019-12-26 21:18:49,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:18:49,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:49,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:18:49,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:18:49,830 INFO L87 Difference]: Start difference. First operand 6115 states and 17563 transitions. Second operand 3 states. [2019-12-26 21:18:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:49,953 INFO L93 Difference]: Finished difference Result 10427 states and 28313 transitions. [2019-12-26 21:18:49,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:18:49,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-26 21:18:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:49,971 INFO L225 Difference]: With dead ends: 10427 [2019-12-26 21:18:49,972 INFO L226 Difference]: Without dead ends: 10427 [2019-12-26 21:18:49,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:18:50,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10427 states. [2019-12-26 21:18:50,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10427 to 9508. [2019-12-26 21:18:50,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9508 states. [2019-12-26 21:18:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9508 states to 9508 states and 26249 transitions. [2019-12-26 21:18:50,196 INFO L78 Accepts]: Start accepts. Automaton has 9508 states and 26249 transitions. Word has length 17 [2019-12-26 21:18:50,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:50,197 INFO L462 AbstractCegarLoop]: Abstraction has 9508 states and 26249 transitions. [2019-12-26 21:18:50,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:18:50,197 INFO L276 IsEmpty]: Start isEmpty. Operand 9508 states and 26249 transitions. [2019-12-26 21:18:50,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 21:18:50,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:50,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:18:50,202 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:18:50,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:50,203 INFO L82 PathProgramCache]: Analyzing trace with hash -249657895, now seen corresponding path program 1 times [2019-12-26 21:18:50,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:50,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550879447] [2019-12-26 21:18:50,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:50,286 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-26 21:18:50,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550879447] [2019-12-26 21:18:50,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:50,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:18:50,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319613078] [2019-12-26 21:18:50,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:18:50,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:50,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:18:50,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:18:50,289 INFO L87 Difference]: Start difference. First operand 9508 states and 26249 transitions. Second operand 4 states. [2019-12-26 21:18:50,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:50,661 INFO L93 Difference]: Finished difference Result 11972 states and 32474 transitions. [2019-12-26 21:18:50,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:18:50,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 21:18:50,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:50,683 INFO L225 Difference]: With dead ends: 11972 [2019-12-26 21:18:50,684 INFO L226 Difference]: Without dead ends: 11972 [2019-12-26 21:18:50,684 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-26 21:18:50,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11972 states. [2019-12-26 21:18:50,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11972 to 9557. [2019-12-26 21:18:50,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9557 states. [2019-12-26 21:18:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9557 states to 9557 states and 26379 transitions. [2019-12-26 21:18:50,888 INFO L78 Accepts]: Start accepts. Automaton has 9557 states and 26379 transitions. Word has length 19 [2019-12-26 21:18:50,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:50,888 INFO L462 AbstractCegarLoop]: Abstraction has 9557 states and 26379 transitions. [2019-12-26 21:18:50,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:18:50,889 INFO L276 IsEmpty]: Start isEmpty. Operand 9557 states and 26379 transitions. [2019-12-26 21:18:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-26 21:18:50,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:50,903 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:18:50,903 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:18:50,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:50,904 INFO L82 PathProgramCache]: Analyzing trace with hash -798739535, now seen corresponding path program 1 times [2019-12-26 21:18:50,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:50,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901565908] [2019-12-26 21:18:50,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:50,971 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-26 21:18:50,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901565908] [2019-12-26 21:18:50,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:50,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:18:50,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112101825] [2019-12-26 21:18:50,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:18:50,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:50,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:18:50,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:18:50,974 INFO L87 Difference]: Start difference. First operand 9557 states and 26379 transitions. Second operand 5 states. [2019-12-26 21:18:51,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:51,034 INFO L93 Difference]: Finished difference Result 7539 states and 21591 transitions. [2019-12-26 21:18:51,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:18:51,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-26 21:18:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:51,049 INFO L225 Difference]: With dead ends: 7539 [2019-12-26 21:18:51,049 INFO L226 Difference]: Without dead ends: 7539 [2019-12-26 21:18:51,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:18:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7539 states. [2019-12-26 21:18:51,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7539 to 7181. [2019-12-26 21:18:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7181 states. [2019-12-26 21:18:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7181 states to 7181 states and 20738 transitions. [2019-12-26 21:18:51,189 INFO L78 Accepts]: Start accepts. Automaton has 7181 states and 20738 transitions. Word has length 31 [2019-12-26 21:18:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:51,189 INFO L462 AbstractCegarLoop]: Abstraction has 7181 states and 20738 transitions. [2019-12-26 21:18:51,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:18:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 7181 states and 20738 transitions. [2019-12-26 21:18:51,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-26 21:18:51,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:51,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:18:51,208 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:18:51,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:51,209 INFO L82 PathProgramCache]: Analyzing trace with hash 29406577, now seen corresponding path program 1 times [2019-12-26 21:18:51,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:51,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023634714] [2019-12-26 21:18:51,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:51,342 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-26 21:18:51,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023634714] [2019-12-26 21:18:51,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:51,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:18:51,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645943331] [2019-12-26 21:18:51,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:18:51,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:51,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:18:51,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:18:51,345 INFO L87 Difference]: Start difference. First operand 7181 states and 20738 transitions. Second operand 4 states. [2019-12-26 21:18:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:51,386 INFO L93 Difference]: Finished difference Result 8167 states and 22928 transitions. [2019-12-26 21:18:51,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:18:51,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-26 21:18:51,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:51,394 INFO L225 Difference]: With dead ends: 8167 [2019-12-26 21:18:51,394 INFO L226 Difference]: Without dead ends: 4572 [2019-12-26 21:18:51,394 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-26 21:18:51,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4572 states. [2019-12-26 21:18:51,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4572 to 4572. [2019-12-26 21:18:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4572 states. [2019-12-26 21:18:51,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4572 states to 4572 states and 11736 transitions. [2019-12-26 21:18:51,451 INFO L78 Accepts]: Start accepts. Automaton has 4572 states and 11736 transitions. Word has length 61 [2019-12-26 21:18:51,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:51,451 INFO L462 AbstractCegarLoop]: Abstraction has 4572 states and 11736 transitions. [2019-12-26 21:18:51,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:18:51,451 INFO L276 IsEmpty]: Start isEmpty. Operand 4572 states and 11736 transitions. [2019-12-26 21:18:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-26 21:18:51,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:51,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:18:51,461 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:18:51,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:51,461 INFO L82 PathProgramCache]: Analyzing trace with hash -157557491, now seen corresponding path program 2 times [2019-12-26 21:18:51,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:51,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786995037] [2019-12-26 21:18:51,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:51,525 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-26 21:18:51,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786995037] [2019-12-26 21:18:51,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:51,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:18:51,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036040225] [2019-12-26 21:18:51,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:18:51,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:51,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:18:51,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:18:51,528 INFO L87 Difference]: Start difference. First operand 4572 states and 11736 transitions. Second operand 3 states. [2019-12-26 21:18:51,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:51,551 INFO L93 Difference]: Finished difference Result 5063 states and 12852 transitions. [2019-12-26 21:18:51,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:18:51,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-26 21:18:51,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:51,554 INFO L225 Difference]: With dead ends: 5063 [2019-12-26 21:18:51,554 INFO L226 Difference]: Without dead ends: 564 [2019-12-26 21:18:51,554 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-26 21:18:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-12-26 21:18:51,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-12-26 21:18:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-12-26 21:18:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1226 transitions. [2019-12-26 21:18:51,563 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1226 transitions. Word has length 61 [2019-12-26 21:18:51,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:51,564 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 1226 transitions. [2019-12-26 21:18:51,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:18:51,564 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1226 transitions. [2019-12-26 21:18:51,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-26 21:18:51,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:51,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:18:51,567 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:18:51,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:51,568 INFO L82 PathProgramCache]: Analyzing trace with hash 682252101, now seen corresponding path program 3 times [2019-12-26 21:18:51,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:51,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73599482] [2019-12-26 21:18:51,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:51,692 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-26 21:18:51,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73599482] [2019-12-26 21:18:51,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:51,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:18:51,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308811990] [2019-12-26 21:18:51,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:18:51,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:51,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:18:51,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:18:51,694 INFO L87 Difference]: Start difference. First operand 564 states and 1226 transitions. Second operand 7 states. [2019-12-26 21:18:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:51,893 INFO L93 Difference]: Finished difference Result 1119 states and 2394 transitions. [2019-12-26 21:18:51,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 21:18:51,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2019-12-26 21:18:51,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:51,895 INFO L225 Difference]: With dead ends: 1119 [2019-12-26 21:18:51,895 INFO L226 Difference]: Without dead ends: 812 [2019-12-26 21:18:51,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:18:51,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2019-12-26 21:18:51,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 642. [2019-12-26 21:18:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-26 21:18:51,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1355 transitions. [2019-12-26 21:18:51,905 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1355 transitions. Word has length 61 [2019-12-26 21:18:51,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:51,906 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 1355 transitions. [2019-12-26 21:18:51,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:18:51,906 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1355 transitions. [2019-12-26 21:18:51,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-26 21:18:51,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:51,908 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:18:51,908 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:18:51,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:51,908 INFO L82 PathProgramCache]: Analyzing trace with hash -430824279, now seen corresponding path program 4 times [2019-12-26 21:18:51,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:51,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137149541] [2019-12-26 21:18:51,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:51,988 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-26 21:18:51,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137149541] [2019-12-26 21:18:51,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:51,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:18:51,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483531729] [2019-12-26 21:18:51,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:18:51,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:51,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:18:51,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:18:51,990 INFO L87 Difference]: Start difference. First operand 642 states and 1355 transitions. Second operand 5 states. [2019-12-26 21:18:52,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:52,058 INFO L93 Difference]: Finished difference Result 1271 states and 2696 transitions. [2019-12-26 21:18:52,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:18:52,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-12-26 21:18:52,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:52,060 INFO L225 Difference]: With dead ends: 1271 [2019-12-26 21:18:52,060 INFO L226 Difference]: Without dead ends: 641 [2019-12-26 21:18:52,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:18:52,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-12-26 21:18:52,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-12-26 21:18:52,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-12-26 21:18:52,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1353 transitions. [2019-12-26 21:18:52,070 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1353 transitions. Word has length 61 [2019-12-26 21:18:52,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:52,070 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 1353 transitions. [2019-12-26 21:18:52,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:18:52,070 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1353 transitions. [2019-12-26 21:18:52,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-26 21:18:52,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:52,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:18:52,073 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:18:52,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:52,073 INFO L82 PathProgramCache]: Analyzing trace with hash 960866040, now seen corresponding path program 1 times [2019-12-26 21:18:52,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:52,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278318799] [2019-12-26 21:18:52,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:52,392 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-26 21:18:52,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278318799] [2019-12-26 21:18:52,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:52,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:18:52,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160115598] [2019-12-26 21:18:52,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:18:52,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:52,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:18:52,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:18:52,395 INFO L87 Difference]: Start difference. First operand 641 states and 1353 transitions. Second operand 10 states. [2019-12-26 21:18:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:52,985 INFO L93 Difference]: Finished difference Result 1129 states and 2294 transitions. [2019-12-26 21:18:52,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 21:18:52,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-12-26 21:18:52,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:52,988 INFO L225 Difference]: With dead ends: 1129 [2019-12-26 21:18:52,988 INFO L226 Difference]: Without dead ends: 1129 [2019-12-26 21:18:52,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-26 21:18:52,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-12-26 21:18:52,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 978. [2019-12-26 21:18:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2019-12-26 21:18:52,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 2038 transitions. [2019-12-26 21:18:53,000 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 2038 transitions. Word has length 62 [2019-12-26 21:18:53,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:53,000 INFO L462 AbstractCegarLoop]: Abstraction has 978 states and 2038 transitions. [2019-12-26 21:18:53,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:18:53,000 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 2038 transitions. [2019-12-26 21:18:53,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-26 21:18:53,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:53,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:18:53,002 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:18:53,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:53,002 INFO L82 PathProgramCache]: Analyzing trace with hash -187536922, now seen corresponding path program 2 times [2019-12-26 21:18:53,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:53,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896844161] [2019-12-26 21:18:53,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:53,099 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-26 21:18:53,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896844161] [2019-12-26 21:18:53,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:53,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:18:53,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120246355] [2019-12-26 21:18:53,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:18:53,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:53,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:18:53,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:18:53,101 INFO L87 Difference]: Start difference. First operand 978 states and 2038 transitions. Second operand 8 states. [2019-12-26 21:18:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:53,339 INFO L93 Difference]: Finished difference Result 1519 states and 2980 transitions. [2019-12-26 21:18:53,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 21:18:53,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-26 21:18:53,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:53,342 INFO L225 Difference]: With dead ends: 1519 [2019-12-26 21:18:53,343 INFO L226 Difference]: Without dead ends: 1349 [2019-12-26 21:18:53,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-26 21:18:53,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2019-12-26 21:18:53,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 988. [2019-12-26 21:18:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-12-26 21:18:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 2058 transitions. [2019-12-26 21:18:53,363 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 2058 transitions. Word has length 62 [2019-12-26 21:18:53,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:53,363 INFO L462 AbstractCegarLoop]: Abstraction has 988 states and 2058 transitions. [2019-12-26 21:18:53,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:18:53,363 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 2058 transitions. [2019-12-26 21:18:53,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-26 21:18:53,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:53,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:18:53,367 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:18:53,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:53,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1980493894, now seen corresponding path program 3 times [2019-12-26 21:18:53,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:53,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45724449] [2019-12-26 21:18:53,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:53,454 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-26 21:18:53,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45724449] [2019-12-26 21:18:53,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:53,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:18:53,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236236302] [2019-12-26 21:18:53,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:18:53,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:53,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:18:53,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:18:53,456 INFO L87 Difference]: Start difference. First operand 988 states and 2058 transitions. Second operand 6 states. [2019-12-26 21:18:53,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:53,854 INFO L93 Difference]: Finished difference Result 1472 states and 3018 transitions. [2019-12-26 21:18:53,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:18:53,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-26 21:18:53,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:53,857 INFO L225 Difference]: With dead ends: 1472 [2019-12-26 21:18:53,858 INFO L226 Difference]: Without dead ends: 1472 [2019-12-26 21:18:53,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:18:53,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2019-12-26 21:18:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1056. [2019-12-26 21:18:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2019-12-26 21:18:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 2206 transitions. [2019-12-26 21:18:53,871 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 2206 transitions. Word has length 62 [2019-12-26 21:18:53,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:53,871 INFO L462 AbstractCegarLoop]: Abstraction has 1056 states and 2206 transitions. [2019-12-26 21:18:53,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:18:53,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 2206 transitions. [2019-12-26 21:18:53,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-26 21:18:53,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:53,873 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:18:53,874 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:18:53,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:53,874 INFO L82 PathProgramCache]: Analyzing trace with hash -10651334, now seen corresponding path program 4 times [2019-12-26 21:18:53,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:53,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500512762] [2019-12-26 21:18:53,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:53,939 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-26 21:18:53,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500512762] [2019-12-26 21:18:53,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:53,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:18:53,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393552260] [2019-12-26 21:18:53,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:18:53,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:53,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:18:53,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:18:53,941 INFO L87 Difference]: Start difference. First operand 1056 states and 2206 transitions. Second operand 3 states. [2019-12-26 21:18:53,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:53,954 INFO L93 Difference]: Finished difference Result 1056 states and 2205 transitions. [2019-12-26 21:18:53,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:18:53,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-26 21:18:53,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:53,956 INFO L225 Difference]: With dead ends: 1056 [2019-12-26 21:18:53,956 INFO L226 Difference]: Without dead ends: 1056 [2019-12-26 21:18:53,956 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-26 21:18:53,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-12-26 21:18:53,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 882. [2019-12-26 21:18:53,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-12-26 21:18:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1874 transitions. [2019-12-26 21:18:53,969 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1874 transitions. Word has length 62 [2019-12-26 21:18:53,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:53,970 INFO L462 AbstractCegarLoop]: Abstraction has 882 states and 1874 transitions. [2019-12-26 21:18:53,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:18:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1874 transitions. [2019-12-26 21:18:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 21:18:53,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:53,972 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:18:53,972 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:18:53,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:53,972 INFO L82 PathProgramCache]: Analyzing trace with hash 279364820, now seen corresponding path program 1 times [2019-12-26 21:18:53,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:53,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347878841] [2019-12-26 21:18:53,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:18:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:18:54,105 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:18:54,106 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:18:54,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= v_~y$r_buff0_thd0~0_148 0) (= v_~y$r_buff1_thd0~0_211 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$mem_tmp~0_192 0) (= 0 v_~y$r_buff0_thd3~0_503) (= v_~main$tmp_guard1~0_31 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t168~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t168~0.base_25|) |v_ULTIMATE.start_main_~#t168~0.offset_18| 0))) (= v_~y$r_buff1_thd1~0_145 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= v_~x~0_69 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t168~0.base_25| 1)) (= v_~y$w_buff0_used~0_960 0) (= 0 v_~__unbuffered_p1_EAX~0_58) (= 0 v_~y$r_buff0_thd2~0_341) (= v_~y$w_buff1~0_320 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd1~0_76 0) (= 0 v_~y$r_buff1_thd2~0_299) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~y$flush_delayed~0_267 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t168~0.base_25|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t168~0.base_25| 4)) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~z~0_25 0) (= 0 v_~weak$$choice0~0_179) (= v_~y~0_332 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t168~0.base_25|) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~y$w_buff0~0_491) (= |v_ULTIMATE.start_main_~#t168~0.offset_18| 0) (= v_~weak$$choice2~0_259 0) (= v_~y$w_buff1_used~0_583 0) (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~y$r_buff1_thd3~0_336))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_24|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t169~0.base=|v_ULTIMATE.start_main_~#t169~0.base_26|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_192, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_336, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_58, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_76, ~y$flush_delayed~0=v_~y$flush_delayed~0_267, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_68|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_56|, ~weak$$choice0~0=v_~weak$$choice0~0_179, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_144|, ~y$w_buff1~0=v_~y$w_buff1~0_320, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_211, ~x~0=v_~x~0_69, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_960, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ULTIMATE.start_main_~#t170~0.offset=|v_ULTIMATE.start_main_~#t170~0.offset_15|, ULTIMATE.start_main_~#t168~0.offset=|v_ULTIMATE.start_main_~#t168~0.offset_18|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_145, ULTIMATE.start_main_~#t170~0.base=|v_ULTIMATE.start_main_~#t170~0.base_22|, ~y$w_buff0~0=v_~y$w_buff0~0_491, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_503, ~y~0=v_~y~0_332, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_~#t168~0.base=|v_ULTIMATE.start_main_~#t168~0.base_25|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_108|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_299, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_148, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_259, ULTIMATE.start_main_~#t169~0.offset=|v_ULTIMATE.start_main_~#t169~0.offset_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_583} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ULTIMATE.start_main_~#t169~0.base, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t170~0.offset, ULTIMATE.start_main_~#t168~0.offset, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t170~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t168~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t169~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 21:18:54,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L833-1-->L835: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t169~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t169~0.base_13|) |v_ULTIMATE.start_main_~#t169~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t169~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t169~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t169~0.base_13| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t169~0.base_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t169~0.base_13|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t169~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t169~0.base=|v_ULTIMATE.start_main_~#t169~0.base_13|, ULTIMATE.start_main_~#t169~0.offset=|v_ULTIMATE.start_main_~#t169~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t169~0.base, ULTIMATE.start_main_~#t169~0.offset] because there is no mapped edge [2019-12-26 21:18:54,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L835-1-->L837: Formula: (and (= |v_ULTIMATE.start_main_~#t170~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t170~0.base_12| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t170~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t170~0.base_12|) |v_ULTIMATE.start_main_~#t170~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t170~0.base_12|) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t170~0.base_12|) 0) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t170~0.base_12| 1)) (not (= |v_ULTIMATE.start_main_~#t170~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t170~0.base=|v_ULTIMATE.start_main_~#t170~0.base_12|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t170~0.offset=|v_ULTIMATE.start_main_~#t170~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t170~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t170~0.offset] because there is no mapped edge [2019-12-26 21:18:54,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] L4-->L795: Formula: (and (= v_~y~0_46 v_~y$mem_tmp~0_31) (= v_~y$r_buff0_thd0~0_28 v_~y$r_buff1_thd0~0_28) (= 1 v_~y$r_buff0_thd3~0_110) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_17) (= |v_P2Thread1of1ForFork0_#t~nondet27_34| v_~weak$$choice2~0_67) (= v_~y$r_buff0_thd3~0_111 v_~y$r_buff1_thd3~0_58) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_46)) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_43) (= |v_P2Thread1of1ForFork0_#t~nondet26_34| v_~weak$$choice0~0_28) (= v_~weak$$choice2~0_67 v_~y$flush_delayed~0_40)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_111, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_34|, ~y~0=v_~y~0_46, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_34|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_46} OutVars{P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_33|, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_33|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_46, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_28, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_58, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_67, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_28} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet27, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-26 21:18:54,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In216127744 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In216127744 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out216127744| ~y$w_buff0~0_In216127744)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out216127744| ~y$w_buff1~0_In216127744) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In216127744, ~y$w_buff1~0=~y$w_buff1~0_In216127744, ~y$w_buff0~0=~y$w_buff0~0_In216127744, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In216127744} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out216127744|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In216127744, ~y$w_buff1~0=~y$w_buff1~0_In216127744, ~y$w_buff0~0=~y$w_buff0~0_In216127744, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In216127744} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-26 21:18:54,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L795-4-->L796: Formula: (= v_~y~0_60 |v_P2Thread1of1ForFork0_#t~ite28_12|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_12|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_11|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, ~y~0=v_~y~0_60} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-26 21:18:54,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L800-->L801: Formula: (and (= v_~y$r_buff0_thd3~0_109 v_~y$r_buff0_thd3~0_108) (not (= (mod v_~weak$$choice2~0_66 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_66} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_11|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_108, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_8|, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:18:54,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1588298096 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out1588298096| ~y$mem_tmp~0_In1588298096) (not .cse0)) (and (= ~y~0_In1588298096 |P2Thread1of1ForFork0_#t~ite48_Out1588298096|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1588298096, ~y$flush_delayed~0=~y$flush_delayed~0_In1588298096, ~y~0=~y~0_In1588298096} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out1588298096|, ~y$mem_tmp~0=~y$mem_tmp~0_In1588298096, ~y$flush_delayed~0=~y$flush_delayed~0_In1588298096, ~y~0=~y~0_In1588298096} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-26 21:18:54,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= v_~z~0_12 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.base_9 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_~x~0_40 1) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_9|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_40, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-26 21:18:54,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1257067516 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out1257067516| ~y~0_In1257067516)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out1257067516| ~y$mem_tmp~0_In1257067516) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1257067516, ~y$flush_delayed~0=~y$flush_delayed~0_In1257067516, ~y~0=~y~0_In1257067516} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1257067516, ~y$flush_delayed~0=~y$flush_delayed~0_In1257067516, ~y~0=~y~0_In1257067516, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1257067516|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-26 21:18:54,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L766-2-->P1EXIT: Formula: (and (= v_~y~0_147 |v_P1Thread1of1ForFork2_#t~ite25_68|) (= v_~y$flush_delayed~0_118 0) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_68|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_118, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~y~0=v_~y~0_147, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_67|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-26 21:18:54,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-534655762 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-534655762 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite51_Out-534655762| 0)) (and (= |P2Thread1of1ForFork0_#t~ite51_Out-534655762| ~y$w_buff0_used~0_In-534655762) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-534655762, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-534655762} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-534655762, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-534655762, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-534655762|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-26 21:18:54,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-2107595772 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2107595772 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2107595772 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-2107595772 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite52_Out-2107595772| 0)) (and (= |P2Thread1of1ForFork0_#t~ite52_Out-2107595772| ~y$w_buff1_used~0_In-2107595772) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2107595772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2107595772, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2107595772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2107595772} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2107595772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2107595772, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2107595772, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-2107595772|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2107595772} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-26 21:18:54,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L814: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1772599970 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1772599970 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In1772599970 ~y$r_buff0_thd3~0_Out1772599970)) (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out1772599970)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1772599970, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1772599970} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1772599970, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1772599970, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out1772599970|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-26 21:18:54,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-526325296 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-526325296 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-526325296 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-526325296 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite54_Out-526325296| ~y$r_buff1_thd3~0_In-526325296)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out-526325296| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-526325296, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-526325296, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-526325296, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-526325296} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-526325296, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-526325296, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-526325296|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-526325296, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-526325296} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-26 21:18:54,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L814-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~y$r_buff1_thd3~0_276 |v_P2Thread1of1ForFork0_#t~ite54_36|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_276, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 21:18:54,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L837-1-->L843: Formula: (and (= 3 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:18:54,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L843-2-->L843-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out-1818304430| |ULTIMATE.start_main_#t~ite58_Out-1818304430|)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1818304430 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1818304430 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite58_Out-1818304430| ~y~0_In-1818304430)) (and .cse0 (not .cse2) (= ~y$w_buff1~0_In-1818304430 |ULTIMATE.start_main_#t~ite58_Out-1818304430|) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1818304430, ~y~0=~y~0_In-1818304430, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1818304430, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1818304430} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1818304430, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1818304430|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1818304430|, ~y~0=~y~0_In-1818304430, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1818304430, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1818304430} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-26 21:18:54,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In2019676159 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In2019676159 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out2019676159| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite60_Out2019676159| ~y$w_buff0_used~0_In2019676159) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2019676159, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2019676159} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out2019676159|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2019676159, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2019676159} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-26 21:18:54,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L845-->L845-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In208415287 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In208415287 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In208415287 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In208415287 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out208415287| ~y$w_buff1_used~0_In208415287) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite61_Out208415287| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In208415287, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In208415287, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In208415287, ~y$w_buff1_used~0=~y$w_buff1_used~0_In208415287} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out208415287|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In208415287, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In208415287, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In208415287, ~y$w_buff1_used~0=~y$w_buff1_used~0_In208415287} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-26 21:18:54,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In666386154 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In666386154 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite62_Out666386154| 0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In666386154 |ULTIMATE.start_main_#t~ite62_Out666386154|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In666386154, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In666386154} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out666386154|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In666386154, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In666386154} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-26 21:18:54,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L847-->L847-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2127288103 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-2127288103 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2127288103 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-2127288103 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-2127288103| ~y$r_buff1_thd0~0_In-2127288103) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite63_Out-2127288103| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2127288103, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2127288103, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2127288103, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2127288103} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-2127288103|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2127288103, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2127288103, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2127288103, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2127288103} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-26 21:18:54,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p1_EAX~0_53) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$r_buff1_thd0~0_206 |v_ULTIMATE.start_main_#t~ite63_48|) (= v_~x~0_64 2) (= v_~__unbuffered_p2_EBX~0_28 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_25 256)) (= 1 v_~__unbuffered_p2_EAX~0_42) (= v_~main$tmp_guard1~0_25 0) (= v_~__unbuffered_p1_EBX~0_35 0)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_48|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_206, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:18:54,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:18:54 BasicIcfg [2019-12-26 21:18:54,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:18:54,272 INFO L168 Benchmark]: Toolchain (without parser) took 26804.72 ms. Allocated memory was 145.8 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 102.0 MB in the beginning and 416.0 MB in the end (delta: -314.0 MB). Peak memory consumption was 737.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:18:54,272 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-26 21:18:54,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 888.87 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.6 MB in the beginning and 156.3 MB in the end (delta: -54.7 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-26 21:18:54,274 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.05 ms. Allocated memory is still 203.9 MB. Free memory was 156.3 MB in the beginning and 153.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:18:54,277 INFO L168 Benchmark]: Boogie Preprocessor took 45.32 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 150.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:18:54,278 INFO L168 Benchmark]: RCFGBuilder took 1123.73 ms. Allocated memory is still 203.9 MB. Free memory was 150.6 MB in the beginning and 95.5 MB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 7.1 GB. [2019-12-26 21:18:54,279 INFO L168 Benchmark]: TraceAbstraction took 24666.23 ms. Allocated memory was 203.9 MB in the beginning and 1.2 GB in the end (delta: 993.5 MB). Free memory was 95.5 MB in the beginning and 416.0 MB in the end (delta: -320.5 MB). Peak memory consumption was 673.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:18:54,286 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 888.87 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.6 MB in the beginning and 156.3 MB in the end (delta: -54.7 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.05 ms. Allocated memory is still 203.9 MB. Free memory was 156.3 MB in the beginning and 153.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.32 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 150.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1123.73 ms. Allocated memory is still 203.9 MB. Free memory was 150.6 MB in the beginning and 95.5 MB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24666.23 ms. Allocated memory was 203.9 MB in the beginning and 1.2 GB in the end (delta: 993.5 MB). Free memory was 95.5 MB in the beginning and 416.0 MB in the end (delta: -320.5 MB). Peak memory consumption was 673.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 195 ProgramPointsBefore, 110 ProgramPointsAfterwards, 241 TransitionsBefore, 133 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 27 ChoiceCompositions, 9977 VarBasedMoverChecksPositive, 318 VarBasedMoverChecksNegative, 79 SemBasedMoverChecksPositive, 323 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 0 MoverChecksTotal, 128241 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t168, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t169, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t170, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L795] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L797] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L798] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y = y$flush_delayed ? y$mem_tmp : y [L804] 3 y$flush_delayed = (_Bool)0 [L807] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 2 x = 2 [L751] 2 __unbuffered_p1_EAX = x [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L764] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L811] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L812] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L844] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L845] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L846] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 186 locations, 2 error locations. Result: UNSAFE, OverallTime: 24.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2639 SDtfs, 2486 SDslu, 5215 SDs, 0 SdLazy, 1770 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47186occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 5060 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 594 ConstructedInterpolants, 0 QuantifiedInterpolants, 101418 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...