/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:30:30,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:30:30,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:30:30,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:30:30,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:30:30,256 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:30:30,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:30:30,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:30:30,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:30:30,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:30:30,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:30:30,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:30:30,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:30:30,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:30:30,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:30:30,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:30:30,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:30:30,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:30:30,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:30:30,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:30:30,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:30:30,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:30:30,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:30:30,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:30:30,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:30:30,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:30:30,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:30:30,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:30:30,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:30:30,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:30:30,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:30:30,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:30:30,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:30:30,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:30:30,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:30:30,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:30:30,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:30:30,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:30:30,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:30:30,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:30:30,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:30:30,289 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:30:30,303 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:30:30,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:30:30,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:30:30,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:30:30,305 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:30:30,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:30:30,305 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:30:30,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:30:30,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:30:30,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:30:30,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:30:30,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:30:30,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:30:30,307 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:30:30,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:30:30,307 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:30:30,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:30:30,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:30:30,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:30:30,308 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:30:30,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:30:30,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:30:30,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:30:30,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:30:30,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:30:30,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:30:30,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:30:30,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:30:30,310 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:30:30,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:30:30,596 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:30:30,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:30:30,601 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:30:30,601 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:30:30,604 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.opt.i [2019-12-27 02:30:30,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea72dadba/e56e86e4ae174b70a215800a658dc155/FLAGd28a48c4a [2019-12-27 02:30:31,235 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:30:31,235 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.opt.i [2019-12-27 02:30:31,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea72dadba/e56e86e4ae174b70a215800a658dc155/FLAGd28a48c4a [2019-12-27 02:30:31,514 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea72dadba/e56e86e4ae174b70a215800a658dc155 [2019-12-27 02:30:31,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:30:31,526 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:30:31,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:30:31,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:30:31,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:30:31,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:30:31" (1/1) ... [2019-12-27 02:30:31,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:30:31, skipping insertion in model container [2019-12-27 02:30:31,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:30:31" (1/1) ... [2019-12-27 02:30:31,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:30:31,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:30:32,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:30:32,129 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:30:32,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:30:32,273 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:30:32,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:30:32 WrapperNode [2019-12-27 02:30:32,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:30:32,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:30:32,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:30:32,275 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:30:32,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:30:32" (1/1) ... [2019-12-27 02:30:32,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:30:32" (1/1) ... [2019-12-27 02:30:32,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:30:32,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:30:32,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:30:32,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:30:32,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:30:32" (1/1) ... [2019-12-27 02:30:32,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:30:32" (1/1) ... [2019-12-27 02:30:32,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:30:32" (1/1) ... [2019-12-27 02:30:32,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:30:32" (1/1) ... [2019-12-27 02:30:32,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:30:32" (1/1) ... [2019-12-27 02:30:32,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:30:32" (1/1) ... [2019-12-27 02:30:32,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:30:32" (1/1) ... [2019-12-27 02:30:32,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:30:32,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:30:32,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:30:32,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:30:32,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:30:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:30:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:30:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:30:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:30:32,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:30:32,450 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:30:32,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:30:32,450 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:30:32,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:30:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:30:32,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:30:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 02:30:32,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 02:30:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:30:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:30:32,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:30:32,454 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:30:33,212 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:30:33,212 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:30:33,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:30:33 BoogieIcfgContainer [2019-12-27 02:30:33,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:30:33,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:30:33,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:30:33,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:30:33,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:30:31" (1/3) ... [2019-12-27 02:30:33,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f643728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:30:33, skipping insertion in model container [2019-12-27 02:30:33,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:30:32" (2/3) ... [2019-12-27 02:30:33,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f643728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:30:33, skipping insertion in model container [2019-12-27 02:30:33,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:30:33" (3/3) ... [2019-12-27 02:30:33,222 INFO L109 eAbstractionObserver]: Analyzing ICFG mix040_tso.opt.i [2019-12-27 02:30:33,233 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:30:33,233 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:30:33,241 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:30:33,242 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:30:33,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,280 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,280 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,282 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,282 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,285 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,285 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,309 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,309 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,309 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,310 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,310 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,310 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,310 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,311 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,312 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,312 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,312 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,312 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,317 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,317 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,317 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,317 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,337 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,339 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,349 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,350 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,350 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,350 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,350 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,350 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,350 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,351 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,351 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,353 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,353 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:30:33,371 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 02:30:33,391 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:30:33,391 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:30:33,392 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:30:33,392 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:30:33,392 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:30:33,392 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:30:33,392 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:30:33,392 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:30:33,410 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 191 transitions [2019-12-27 02:30:33,412 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-27 02:30:33,508 INFO L132 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-27 02:30:33,509 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:30:33,523 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 02:30:33,543 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-27 02:30:33,594 INFO L132 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-27 02:30:33,594 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:30:33,600 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 02:30:33,616 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 02:30:33,617 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:30:38,932 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 02:30:39,083 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 02:30:39,099 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46301 [2019-12-27 02:30:39,099 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-27 02:30:39,103 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 83 transitions [2019-12-27 02:30:40,858 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27254 states. [2019-12-27 02:30:40,859 INFO L276 IsEmpty]: Start isEmpty. Operand 27254 states. [2019-12-27 02:30:40,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 02:30:40,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:30:40,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:30:40,868 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:30:40,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:30:40,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2114616633, now seen corresponding path program 1 times [2019-12-27 02:30:40,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:30:40,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675580949] [2019-12-27 02:30:40,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:30:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:30:41,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:30:41,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675580949] [2019-12-27 02:30:41,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:30:41,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:30:41,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946152800] [2019-12-27 02:30:41,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:30:41,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:30:41,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:30:41,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:30:41,179 INFO L87 Difference]: Start difference. First operand 27254 states. Second operand 3 states. [2019-12-27 02:30:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:30:41,625 INFO L93 Difference]: Finished difference Result 26518 states and 112736 transitions. [2019-12-27 02:30:41,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:30:41,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 02:30:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:30:41,897 INFO L225 Difference]: With dead ends: 26518 [2019-12-27 02:30:41,898 INFO L226 Difference]: Without dead ends: 24958 [2019-12-27 02:30:41,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:30:43,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24958 states. [2019-12-27 02:30:44,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24958 to 24958. [2019-12-27 02:30:44,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24958 states. [2019-12-27 02:30:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24958 states to 24958 states and 105960 transitions. [2019-12-27 02:30:44,223 INFO L78 Accepts]: Start accepts. Automaton has 24958 states and 105960 transitions. Word has length 9 [2019-12-27 02:30:44,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:30:44,224 INFO L462 AbstractCegarLoop]: Abstraction has 24958 states and 105960 transitions. [2019-12-27 02:30:44,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:30:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand 24958 states and 105960 transitions. [2019-12-27 02:30:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:30:44,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:30:44,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:30:44,237 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:30:44,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:30:44,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1982620494, now seen corresponding path program 1 times [2019-12-27 02:30:44,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:30:44,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115014005] [2019-12-27 02:30:44,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:30:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:30:44,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:30:44,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115014005] [2019-12-27 02:30:44,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:30:44,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:30:44,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409496182] [2019-12-27 02:30:44,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:30:44,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:30:44,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:30:44,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:30:44,323 INFO L87 Difference]: Start difference. First operand 24958 states and 105960 transitions. Second operand 3 states. [2019-12-27 02:30:44,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:30:44,674 INFO L93 Difference]: Finished difference Result 19953 states and 78654 transitions. [2019-12-27 02:30:44,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:30:44,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 02:30:44,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:30:44,766 INFO L225 Difference]: With dead ends: 19953 [2019-12-27 02:30:44,766 INFO L226 Difference]: Without dead ends: 19953 [2019-12-27 02:30:44,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:30:45,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19953 states. [2019-12-27 02:30:46,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19953 to 19953. [2019-12-27 02:30:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19953 states. [2019-12-27 02:30:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19953 states to 19953 states and 78654 transitions. [2019-12-27 02:30:46,737 INFO L78 Accepts]: Start accepts. Automaton has 19953 states and 78654 transitions. Word has length 15 [2019-12-27 02:30:46,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:30:46,737 INFO L462 AbstractCegarLoop]: Abstraction has 19953 states and 78654 transitions. [2019-12-27 02:30:46,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:30:46,737 INFO L276 IsEmpty]: Start isEmpty. Operand 19953 states and 78654 transitions. [2019-12-27 02:30:46,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:30:46,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:30:46,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:30:46,740 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:30:46,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:30:46,740 INFO L82 PathProgramCache]: Analyzing trace with hash 832904726, now seen corresponding path program 1 times [2019-12-27 02:30:46,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:30:46,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127643699] [2019-12-27 02:30:46,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:30:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:30:46,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:30:46,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127643699] [2019-12-27 02:30:46,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:30:46,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:30:46,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066114153] [2019-12-27 02:30:46,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:30:46,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:30:46,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:30:46,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:30:46,811 INFO L87 Difference]: Start difference. First operand 19953 states and 78654 transitions. Second operand 4 states. [2019-12-27 02:30:46,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:30:46,903 INFO L93 Difference]: Finished difference Result 9211 states and 30743 transitions. [2019-12-27 02:30:46,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:30:46,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 02:30:46,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:30:46,929 INFO L225 Difference]: With dead ends: 9211 [2019-12-27 02:30:46,929 INFO L226 Difference]: Without dead ends: 9211 [2019-12-27 02:30:46,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:30:47,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9211 states. [2019-12-27 02:30:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9211 to 9211. [2019-12-27 02:30:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9211 states. [2019-12-27 02:30:47,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9211 states to 9211 states and 30743 transitions. [2019-12-27 02:30:47,423 INFO L78 Accepts]: Start accepts. Automaton has 9211 states and 30743 transitions. Word has length 16 [2019-12-27 02:30:47,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:30:47,423 INFO L462 AbstractCegarLoop]: Abstraction has 9211 states and 30743 transitions. [2019-12-27 02:30:47,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:30:47,423 INFO L276 IsEmpty]: Start isEmpty. Operand 9211 states and 30743 transitions. [2019-12-27 02:30:47,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 02:30:47,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:30:47,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:30:47,426 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:30:47,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:30:47,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1159456736, now seen corresponding path program 1 times [2019-12-27 02:30:47,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:30:47,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357895726] [2019-12-27 02:30:47,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:30:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:30:47,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-27 02:30:47,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357895726] [2019-12-27 02:30:47,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:30:47,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:30:47,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062424350] [2019-12-27 02:30:47,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:30:47,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:30:47,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:30:47,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:30:47,527 INFO L87 Difference]: Start difference. First operand 9211 states and 30743 transitions. Second operand 5 states. [2019-12-27 02:30:47,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:30:47,577 INFO L93 Difference]: Finished difference Result 2716 states and 8200 transitions. [2019-12-27 02:30:47,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:30:47,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 02:30:47,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:30:47,586 INFO L225 Difference]: With dead ends: 2716 [2019-12-27 02:30:47,586 INFO L226 Difference]: Without dead ends: 2716 [2019-12-27 02:30:47,587 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-27 02:30:47,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2019-12-27 02:30:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716. [2019-12-27 02:30:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2019-12-27 02:30:47,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 8200 transitions. [2019-12-27 02:30:47,642 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 8200 transitions. Word has length 17 [2019-12-27 02:30:47,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:30:47,642 INFO L462 AbstractCegarLoop]: Abstraction has 2716 states and 8200 transitions. [2019-12-27 02:30:47,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:30:47,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 8200 transitions. [2019-12-27 02:30:47,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 02:30:47,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:30:47,645 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:30:47,645 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:30:47,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:30:47,645 INFO L82 PathProgramCache]: Analyzing trace with hash 965433528, now seen corresponding path program 1 times [2019-12-27 02:30:47,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:30:47,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191994148] [2019-12-27 02:30:47,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:30:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:30:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:30:47,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191994148] [2019-12-27 02:30:47,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:30:47,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:30:47,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949926583] [2019-12-27 02:30:47,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:30:47,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:30:47,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:30:47,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:30:47,706 INFO L87 Difference]: Start difference. First operand 2716 states and 8200 transitions. Second operand 4 states. [2019-12-27 02:30:47,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:30:47,866 INFO L93 Difference]: Finished difference Result 3607 states and 10783 transitions. [2019-12-27 02:30:47,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:30:47,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 02:30:47,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:30:47,876 INFO L225 Difference]: With dead ends: 3607 [2019-12-27 02:30:47,877 INFO L226 Difference]: Without dead ends: 3607 [2019-12-27 02:30:47,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:30:47,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2019-12-27 02:30:47,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3415. [2019-12-27 02:30:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3415 states. [2019-12-27 02:30:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 10347 transitions. [2019-12-27 02:30:47,955 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 10347 transitions. Word has length 18 [2019-12-27 02:30:47,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:30:47,956 INFO L462 AbstractCegarLoop]: Abstraction has 3415 states and 10347 transitions. [2019-12-27 02:30:47,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:30:47,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 10347 transitions. [2019-12-27 02:30:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 02:30:47,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:30:47,964 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] [2019-12-27 02:30:47,964 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:30:47,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:30:47,965 INFO L82 PathProgramCache]: Analyzing trace with hash -792380239, now seen corresponding path program 1 times [2019-12-27 02:30:47,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:30:47,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851339987] [2019-12-27 02:30:47,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:30:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:30:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:30:48,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851339987] [2019-12-27 02:30:48,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:30:48,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:30:48,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746054854] [2019-12-27 02:30:48,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:30:48,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:30:48,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:30:48,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:30:48,062 INFO L87 Difference]: Start difference. First operand 3415 states and 10347 transitions. Second operand 3 states. [2019-12-27 02:30:48,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:30:48,094 INFO L93 Difference]: Finished difference Result 5436 states and 15699 transitions. [2019-12-27 02:30:48,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:30:48,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 02:30:48,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:30:48,102 INFO L225 Difference]: With dead ends: 5436 [2019-12-27 02:30:48,103 INFO L226 Difference]: Without dead ends: 3574 [2019-12-27 02:30:48,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:30:48,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2019-12-27 02:30:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 3488. [2019-12-27 02:30:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3488 states. [2019-12-27 02:30:48,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 9360 transitions. [2019-12-27 02:30:48,176 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 9360 transitions. Word has length 32 [2019-12-27 02:30:48,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:30:48,176 INFO L462 AbstractCegarLoop]: Abstraction has 3488 states and 9360 transitions. [2019-12-27 02:30:48,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:30:48,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 9360 transitions. [2019-12-27 02:30:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 02:30:48,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:30:48,186 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] [2019-12-27 02:30:48,186 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:30:48,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:30:48,187 INFO L82 PathProgramCache]: Analyzing trace with hash -617388800, now seen corresponding path program 1 times [2019-12-27 02:30:48,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:30:48,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564161812] [2019-12-27 02:30:48,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:30:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:30:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:30:48,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564161812] [2019-12-27 02:30:48,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:30:48,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:30:48,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106807708] [2019-12-27 02:30:48,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:30:48,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:30:48,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:30:48,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:30:48,239 INFO L87 Difference]: Start difference. First operand 3488 states and 9360 transitions. Second operand 3 states. [2019-12-27 02:30:48,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:30:48,303 INFO L93 Difference]: Finished difference Result 5140 states and 13647 transitions. [2019-12-27 02:30:48,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:30:48,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 02:30:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:30:48,313 INFO L225 Difference]: With dead ends: 5140 [2019-12-27 02:30:48,313 INFO L226 Difference]: Without dead ends: 5140 [2019-12-27 02:30:48,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:30:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5140 states. [2019-12-27 02:30:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5140 to 4152. [2019-12-27 02:30:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4152 states. [2019-12-27 02:30:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 11165 transitions. [2019-12-27 02:30:48,401 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 11165 transitions. Word has length 32 [2019-12-27 02:30:48,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:30:48,401 INFO L462 AbstractCegarLoop]: Abstraction has 4152 states and 11165 transitions. [2019-12-27 02:30:48,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:30:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 11165 transitions. [2019-12-27 02:30:48,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 02:30:48,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:30:48,411 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] [2019-12-27 02:30:48,411 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:30:48,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:30:48,411 INFO L82 PathProgramCache]: Analyzing trace with hash 937445460, now seen corresponding path program 1 times [2019-12-27 02:30:48,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:30:48,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586851492] [2019-12-27 02:30:48,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:30:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:30:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:30:48,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586851492] [2019-12-27 02:30:48,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:30:48,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:30:48,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783422929] [2019-12-27 02:30:48,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:30:48,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:30:48,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:30:48,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:30:48,475 INFO L87 Difference]: Start difference. First operand 4152 states and 11165 transitions. Second operand 3 states. [2019-12-27 02:30:48,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:30:48,524 INFO L93 Difference]: Finished difference Result 5140 states and 13308 transitions. [2019-12-27 02:30:48,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:30:48,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 02:30:48,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:30:48,533 INFO L225 Difference]: With dead ends: 5140 [2019-12-27 02:30:48,533 INFO L226 Difference]: Without dead ends: 5140 [2019-12-27 02:30:48,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:30:48,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5140 states. [2019-12-27 02:30:48,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5140 to 4108. [2019-12-27 02:30:48,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4108 states. [2019-12-27 02:30:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4108 states to 4108 states and 10730 transitions. [2019-12-27 02:30:48,620 INFO L78 Accepts]: Start accepts. Automaton has 4108 states and 10730 transitions. Word has length 32 [2019-12-27 02:30:48,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:30:48,620 INFO L462 AbstractCegarLoop]: Abstraction has 4108 states and 10730 transitions. [2019-12-27 02:30:48,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:30:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4108 states and 10730 transitions. [2019-12-27 02:30:48,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 02:30:48,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:30:48,630 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] [2019-12-27 02:30:48,630 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:30:48,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:30:48,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1469218903, now seen corresponding path program 1 times [2019-12-27 02:30:48,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:30:48,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789570557] [2019-12-27 02:30:48,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:30:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:30:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:30:48,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789570557] [2019-12-27 02:30:48,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:30:48,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:30:48,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549347301] [2019-12-27 02:30:48,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:30:48,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:30:48,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:30:48,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:30:48,703 INFO L87 Difference]: Start difference. First operand 4108 states and 10730 transitions. Second operand 6 states. [2019-12-27 02:30:48,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:30:48,779 INFO L93 Difference]: Finished difference Result 3096 states and 8255 transitions. [2019-12-27 02:30:48,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:30:48,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 02:30:48,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:30:48,784 INFO L225 Difference]: With dead ends: 3096 [2019-12-27 02:30:48,784 INFO L226 Difference]: Without dead ends: 1590 [2019-12-27 02:30:48,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:30:48,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2019-12-27 02:30:48,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1480. [2019-12-27 02:30:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2019-12-27 02:30:48,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 3877 transitions. [2019-12-27 02:30:48,825 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 3877 transitions. Word has length 32 [2019-12-27 02:30:48,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:30:48,826 INFO L462 AbstractCegarLoop]: Abstraction has 1480 states and 3877 transitions. [2019-12-27 02:30:48,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:30:48,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 3877 transitions. [2019-12-27 02:30:48,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 02:30:48,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:30:48,833 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] [2019-12-27 02:30:48,833 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:30:48,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:30:48,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1467210822, now seen corresponding path program 1 times [2019-12-27 02:30:48,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:30:48,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701850482] [2019-12-27 02:30:48,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:30:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:30:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:30:48,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701850482] [2019-12-27 02:30:48,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:30:48,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:30:48,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13286864] [2019-12-27 02:30:48,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:30:48,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:30:48,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:30:48,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:30:48,964 INFO L87 Difference]: Start difference. First operand 1480 states and 3877 transitions. Second operand 3 states. [2019-12-27 02:30:48,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:30:48,985 INFO L93 Difference]: Finished difference Result 2211 states and 5434 transitions. [2019-12-27 02:30:48,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:30:48,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 02:30:48,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:30:48,987 INFO L225 Difference]: With dead ends: 2211 [2019-12-27 02:30:48,987 INFO L226 Difference]: Without dead ends: 775 [2019-12-27 02:30:48,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:30:48,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-12-27 02:30:49,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2019-12-27 02:30:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-12-27 02:30:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1640 transitions. [2019-12-27 02:30:49,007 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1640 transitions. Word has length 47 [2019-12-27 02:30:49,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:30:49,008 INFO L462 AbstractCegarLoop]: Abstraction has 775 states and 1640 transitions. [2019-12-27 02:30:49,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:30:49,008 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1640 transitions. [2019-12-27 02:30:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 02:30:49,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:30:49,013 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] [2019-12-27 02:30:49,013 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:30:49,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:30:49,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1384248998, now seen corresponding path program 2 times [2019-12-27 02:30:49,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:30:49,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97270350] [2019-12-27 02:30:49,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:30:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:30:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:30:49,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97270350] [2019-12-27 02:30:49,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:30:49,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:30:49,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855743184] [2019-12-27 02:30:49,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:30:49,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:30:49,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:30:49,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:30:49,211 INFO L87 Difference]: Start difference. First operand 775 states and 1640 transitions. Second operand 7 states. [2019-12-27 02:30:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:30:49,523 INFO L93 Difference]: Finished difference Result 1953 states and 4058 transitions. [2019-12-27 02:30:49,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 02:30:49,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-27 02:30:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:30:49,527 INFO L225 Difference]: With dead ends: 1953 [2019-12-27 02:30:49,637 INFO L226 Difference]: Without dead ends: 1317 [2019-12-27 02:30:49,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:30:49,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2019-12-27 02:30:49,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 878. [2019-12-27 02:30:49,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2019-12-27 02:30:49,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1848 transitions. [2019-12-27 02:30:49,653 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1848 transitions. Word has length 47 [2019-12-27 02:30:49,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:30:49,653 INFO L462 AbstractCegarLoop]: Abstraction has 878 states and 1848 transitions. [2019-12-27 02:30:49,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:30:49,654 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1848 transitions. [2019-12-27 02:30:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 02:30:49,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:30:49,657 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] [2019-12-27 02:30:49,657 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:30:49,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:30:49,657 INFO L82 PathProgramCache]: Analyzing trace with hash -801480632, now seen corresponding path program 3 times [2019-12-27 02:30:49,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:30:49,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702167561] [2019-12-27 02:30:49,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:30:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:30:49,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:30:49,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702167561] [2019-12-27 02:30:49,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:30:49,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:30:49,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147455055] [2019-12-27 02:30:49,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:30:49,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:30:49,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:30:49,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:30:49,773 INFO L87 Difference]: Start difference. First operand 878 states and 1848 transitions. Second operand 4 states. [2019-12-27 02:30:49,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:30:49,795 INFO L93 Difference]: Finished difference Result 1419 states and 2990 transitions. [2019-12-27 02:30:49,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:30:49,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-27 02:30:49,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:30:49,797 INFO L225 Difference]: With dead ends: 1419 [2019-12-27 02:30:49,797 INFO L226 Difference]: Without dead ends: 573 [2019-12-27 02:30:49,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:30:49,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-12-27 02:30:49,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2019-12-27 02:30:49,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-12-27 02:30:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1194 transitions. [2019-12-27 02:30:49,806 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1194 transitions. Word has length 47 [2019-12-27 02:30:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:30:49,807 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 1194 transitions. [2019-12-27 02:30:49,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:30:49,807 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1194 transitions. [2019-12-27 02:30:49,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 02:30:49,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:30:49,809 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] [2019-12-27 02:30:49,809 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:30:49,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:30:49,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1009662868, now seen corresponding path program 4 times [2019-12-27 02:30:49,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:30:49,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645334722] [2019-12-27 02:30:49,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:30:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:30:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:30:50,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645334722] [2019-12-27 02:30:50,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:30:50,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:30:50,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596467187] [2019-12-27 02:30:50,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:30:50,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:30:50,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:30:50,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:30:50,125 INFO L87 Difference]: Start difference. First operand 573 states and 1194 transitions. Second operand 9 states. [2019-12-27 02:30:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:30:50,972 INFO L93 Difference]: Finished difference Result 1057 states and 2020 transitions. [2019-12-27 02:30:50,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 02:30:50,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-12-27 02:30:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:30:50,974 INFO L225 Difference]: With dead ends: 1057 [2019-12-27 02:30:50,975 INFO L226 Difference]: Without dead ends: 1033 [2019-12-27 02:30:50,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-27 02:30:50,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2019-12-27 02:30:50,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 612. [2019-12-27 02:30:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-12-27 02:30:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1191 transitions. [2019-12-27 02:30:50,986 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1191 transitions. Word has length 47 [2019-12-27 02:30:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:30:50,987 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 1191 transitions. [2019-12-27 02:30:50,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:30:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1191 transitions. [2019-12-27 02:30:50,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 02:30:50,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:30:50,989 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] [2019-12-27 02:30:50,989 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:30:50,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:30:50,989 INFO L82 PathProgramCache]: Analyzing trace with hash 610940604, now seen corresponding path program 5 times [2019-12-27 02:30:50,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:30:50,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211873814] [2019-12-27 02:30:50,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:30:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:30:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:30:51,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211873814] [2019-12-27 02:30:51,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:30:51,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:30:51,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991561759] [2019-12-27 02:30:51,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:30:51,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:30:51,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:30:51,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:30:51,105 INFO L87 Difference]: Start difference. First operand 612 states and 1191 transitions. Second operand 7 states. [2019-12-27 02:30:51,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:30:51,831 INFO L93 Difference]: Finished difference Result 1089 states and 2100 transitions. [2019-12-27 02:30:51,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:30:51,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-27 02:30:51,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:30:51,833 INFO L225 Difference]: With dead ends: 1089 [2019-12-27 02:30:51,833 INFO L226 Difference]: Without dead ends: 1089 [2019-12-27 02:30:51,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:30:51,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-12-27 02:30:51,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 642. [2019-12-27 02:30:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-27 02:30:51,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1259 transitions. [2019-12-27 02:30:51,845 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1259 transitions. Word has length 47 [2019-12-27 02:30:51,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:30:51,846 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 1259 transitions. [2019-12-27 02:30:51,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:30:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1259 transitions. [2019-12-27 02:30:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 02:30:51,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:30:51,847 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] [2019-12-27 02:30:51,848 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:30:51,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:30:51,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1819205216, now seen corresponding path program 6 times [2019-12-27 02:30:51,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:30:51,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488608368] [2019-12-27 02:30:51,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:30:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:30:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:30:51,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488608368] [2019-12-27 02:30:51,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:30:51,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:30:51,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166170479] [2019-12-27 02:30:51,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:30:51,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:30:51,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:30:51,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:30:51,916 INFO L87 Difference]: Start difference. First operand 642 states and 1259 transitions. Second operand 3 states. [2019-12-27 02:30:51,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:30:51,926 INFO L93 Difference]: Finished difference Result 640 states and 1254 transitions. [2019-12-27 02:30:51,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:30:51,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 02:30:51,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:30:51,927 INFO L225 Difference]: With dead ends: 640 [2019-12-27 02:30:51,927 INFO L226 Difference]: Without dead ends: 640 [2019-12-27 02:30:51,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:30:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-12-27 02:30:51,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 509. [2019-12-27 02:30:51,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-12-27 02:30:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1000 transitions. [2019-12-27 02:30:51,938 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 1000 transitions. Word has length 47 [2019-12-27 02:30:51,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:30:51,938 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 1000 transitions. [2019-12-27 02:30:51,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:30:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 1000 transitions. [2019-12-27 02:30:51,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:30:51,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:30:51,940 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] [2019-12-27 02:30:51,940 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:30:51,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:30:51,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1502542547, now seen corresponding path program 1 times [2019-12-27 02:30:51,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:30:51,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153380414] [2019-12-27 02:30:51,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:30:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:30:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:30:52,098 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:30:52,100 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:30:52,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_97| 0 0))) (and (= 0 v_~z$r_buff1_thd1~0_69) (= |v_ULTIMATE.start_main_~#t1085~0.offset_30| 0) (= 0 v_~z$r_buff1_thd2~0_69) (= v_~z$w_buff0~0_326 0) (= 0 v_~z$r_buff1_thd4~0_128) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p3_EBX~0_104) (= v_~b~0_46 0) (= v_~weak$$choice2~0_157 0) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~z$r_buff0_thd3~0_271) (= v_~z$r_buff0_thd0~0_83 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1085~0.base_46| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1085~0.base_46|)) (= 0 v_~z$flush_delayed~0_78) (= v_~main$tmp_guard1~0_45 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_23 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1085~0.base_46| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1085~0.base_46|) |v_ULTIMATE.start_main_~#t1085~0.offset_30| 0)) |v_#memory_int_25|) (= 0 v_~weak$$choice0~0_39) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z~0_172 0) (= 0 v_~z$r_buff0_thd4~0_139) (= v_~y~0_82 0) (= v_~z$read_delayed~0_7 0) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~z$r_buff1_thd3~0_242) (= 0 |v_#NULL.base_7|) (= v_~z$mem_tmp~0_49 0) (= v_~z$w_buff1_used~0_372 0) (= v_~z$r_buff1_thd0~0_144 0) (= v_~z$w_buff0_used~0_607 0) (= v_~x~0_74 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1085~0.base_46| 1) |v_#valid_95|) (= v_~__unbuffered_p3_EAX~0_105 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1085~0.base_46|) (= v_~z$w_buff1~0_201 0) (= v_~__unbuffered_cnt~0_157 0) (= v_~z$r_buff0_thd2~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_~#t1087~0.base=|v_ULTIMATE.start_main_~#t1087~0.base_45|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_69, ULTIMATE.start_main_~#t1086~0.offset=|v_ULTIMATE.start_main_~#t1086~0.offset_29|, #NULL.offset=|v_#NULL.offset_7|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_83, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_105, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~z$mem_tmp~0=v_~z$mem_tmp~0_49, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_~#t1085~0.offset=|v_ULTIMATE.start_main_~#t1085~0.offset_30|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_372, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_78, ~weak$$choice0~0=v_~weak$$choice0~0_39, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_271, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ULTIMATE.start_main_~#t1086~0.base=|v_ULTIMATE.start_main_~#t1086~0.base_45|, ~x~0=v_~x~0_74, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_128, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1085~0.base=|v_ULTIMATE.start_main_~#t1085~0.base_46|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, ~y~0=v_~y~0_82, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25, ULTIMATE.start_main_~#t1088~0.offset=|v_ULTIMATE.start_main_~#t1088~0.offset_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_607, ~z$w_buff0~0=v_~z$w_buff0~0_326, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_242, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_~#t1088~0.base=|v_ULTIMATE.start_main_~#t1088~0.base_26|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_128|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_104, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_94|, ULTIMATE.start_main_~#t1087~0.offset=|v_ULTIMATE.start_main_~#t1087~0.offset_29|, ~b~0=v_~b~0_46, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_172, ~weak$$choice2~0=v_~weak$$choice2~0_157, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1087~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t1086~0.offset, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1085~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1086~0.base, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1085~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1088~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1088~0.base, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1087~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:30:52,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1086~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1086~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1086~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1086~0.base_13|) |v_ULTIMATE.start_main_~#t1086~0.offset_11| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t1086~0.base_13| 0)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1086~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1086~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1086~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1086~0.offset=|v_ULTIMATE.start_main_~#t1086~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1086~0.base=|v_ULTIMATE.start_main_~#t1086~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t1086~0.offset, #length, ULTIMATE.start_main_~#t1086~0.base] because there is no mapped edge [2019-12-27 02:30:52,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1087~0.base_13|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1087~0.base_13| 4) |v_#length_21|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1087~0.base_13| 1) |v_#valid_50|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1087~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1087~0.base_13|) |v_ULTIMATE.start_main_~#t1087~0.offset_11| 2)) |v_#memory_int_19|) (= |v_ULTIMATE.start_main_~#t1087~0.offset_11| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1087~0.base_13|) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1087~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1087~0.base=|v_ULTIMATE.start_main_~#t1087~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1087~0.offset=|v_ULTIMATE.start_main_~#t1087~0.offset_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1087~0.base, ULTIMATE.start_main_~#t1087~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 02:30:52,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (= |v_ULTIMATE.start_main_~#t1088~0.offset_10| 0) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1088~0.base_11|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1088~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1088~0.base_11|) |v_ULTIMATE.start_main_~#t1088~0.offset_10| 3)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1088~0.base_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1088~0.base_11| 4)) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1088~0.base_11| 1) |v_#valid_42|) (not (= |v_ULTIMATE.start_main_~#t1088~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1088~0.offset=|v_ULTIMATE.start_main_~#t1088~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1088~0.base=|v_ULTIMATE.start_main_~#t1088~0.base_11|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1088~0.offset, ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1088~0.base, #length] because there is no mapped edge [2019-12-27 02:30:52,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_10| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_12) (= v_~z$w_buff0~0_26 v_~z$w_buff1~0_20) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_10| 1) (= 1 v_~z$w_buff0~0_25) (= v_~z$w_buff0_used~0_113 v_~z$w_buff1_used~0_69) (= v_~z$w_buff0_used~0_112 1) (= v_P3Thread1of1ForFork1_~arg.base_10 |v_P3Thread1of1ForFork1_#in~arg.base_10|) (= (mod v_~z$w_buff1_used~0_69 256) 0) (= v_P3Thread1of1ForFork1_~arg.offset_10 |v_P3Thread1of1ForFork1_#in~arg.offset_10|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_26, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_25, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|, ~z$w_buff1~0=v_~z$w_buff1~0_20, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_10, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_10} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 02:30:52,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_~b~0_24 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_18| v_P0Thread1of1ForFork2_~arg.offset_18) (= v_~x~0_35 1) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= v_P0Thread1of1ForFork2_~arg.base_18 |v_P0Thread1of1ForFork2_#in~arg.base_18|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~b~0=v_~b~0_24, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_18, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_35, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_18} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 02:30:52,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= |v_P1Thread1of1ForFork3_#in~arg.base_14| v_P1Thread1of1ForFork3_~arg.base_14) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= v_~x~0_48 2) (= |v_P1Thread1of1ForFork3_#in~arg.offset_14| v_P1Thread1of1ForFork3_~arg.offset_14) (= v_~__unbuffered_cnt~0_131 (+ v_~__unbuffered_cnt~0_132 1)) (= v_~y~0_47 1)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_14, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_14, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|, ~y~0=v_~y~0_47, ~x~0=v_~x~0_48} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-27 02:30:52,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L776-->L776-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-6161752 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite8_In-6161752| |P2Thread1of1ForFork0_#t~ite8_Out-6161752|) (= |P2Thread1of1ForFork0_#t~ite9_Out-6161752| ~z$w_buff0~0_In-6161752)) (and (= |P2Thread1of1ForFork0_#t~ite8_Out-6161752| ~z$w_buff0~0_In-6161752) (= |P2Thread1of1ForFork0_#t~ite9_Out-6161752| |P2Thread1of1ForFork0_#t~ite8_Out-6161752|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-6161752 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-6161752 256) 0) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In-6161752 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-6161752 256))))))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In-6161752|, ~z$w_buff0~0=~z$w_buff0~0_In-6161752, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-6161752, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-6161752, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-6161752, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-6161752, ~weak$$choice2~0=~weak$$choice2~0_In-6161752} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out-6161752|, ~z$w_buff0~0=~z$w_buff0~0_In-6161752, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-6161752, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-6161752, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-6161752, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-6161752, ~weak$$choice2~0=~weak$$choice2~0_In-6161752, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out-6161752|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 02:30:52,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L777-->L777-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In156015110 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite12_Out156015110| ~z$w_buff1~0_In156015110) (= |P2Thread1of1ForFork0_#t~ite11_In156015110| |P2Thread1of1ForFork0_#t~ite11_Out156015110|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite11_Out156015110| ~z$w_buff1~0_In156015110) (= |P2Thread1of1ForFork0_#t~ite12_Out156015110| |P2Thread1of1ForFork0_#t~ite11_Out156015110|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In156015110 256) 0))) (or (= (mod ~z$w_buff0_used~0_In156015110 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In156015110 256)) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In156015110 256)))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In156015110, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In156015110|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In156015110, ~z$w_buff1_used~0=~z$w_buff1_used~0_In156015110, ~z$w_buff1~0=~z$w_buff1~0_In156015110, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In156015110, ~weak$$choice2~0=~weak$$choice2~0_In156015110} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out156015110|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In156015110, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out156015110|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In156015110, ~z$w_buff1_used~0=~z$w_buff1_used~0_In156015110, ~z$w_buff1~0=~z$w_buff1~0_In156015110, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In156015110, ~weak$$choice2~0=~weak$$choice2~0_In156015110} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 02:30:52,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1916087436 256) 0))) (or (and (not .cse0) (= ~z$w_buff0_used~0_In1916087436 |P2Thread1of1ForFork0_#t~ite15_Out1916087436|) (= |P2Thread1of1ForFork0_#t~ite14_In1916087436| |P2Thread1of1ForFork0_#t~ite14_Out1916087436|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1916087436 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1916087436 256)) (and (= 0 (mod ~z$w_buff1_used~0_In1916087436 256)) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In1916087436 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite14_Out1916087436| ~z$w_buff0_used~0_In1916087436) (= |P2Thread1of1ForFork0_#t~ite14_Out1916087436| |P2Thread1of1ForFork0_#t~ite15_Out1916087436|) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In1916087436|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1916087436, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1916087436, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1916087436, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1916087436, ~weak$$choice2~0=~weak$$choice2~0_In1916087436} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1916087436|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out1916087436|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1916087436, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1916087436, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1916087436, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1916087436, ~weak$$choice2~0=~weak$$choice2~0_In1916087436} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-27 02:30:52,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L780-->L781: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~z$r_buff0_thd3~0_73 v_~z$r_buff0_thd3~0_72)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_72, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_11|, ~weak$$choice2~0=v_~weak$$choice2~0_32, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 02:30:52,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1413586776 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1413586776 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork1_#t~ite28_Out-1413586776|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1413586776 |P3Thread1of1ForFork1_#t~ite28_Out-1413586776|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1413586776, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1413586776} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1413586776, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out-1413586776|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1413586776} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 02:30:52,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L783-->L791: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 02:30:52,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In993737557 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In993737557 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In993737557 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In993737557 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork1_#t~ite29_Out993737557|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In993737557 |P3Thread1of1ForFork1_#t~ite29_Out993737557|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In993737557, ~z$w_buff0_used~0=~z$w_buff0_used~0_In993737557, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In993737557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In993737557} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In993737557, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out993737557|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In993737557, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In993737557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In993737557} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 02:30:52,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1885409057 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1885409057 256)))) (or (and (= ~z$r_buff0_thd4~0_Out1885409057 ~z$r_buff0_thd4~0_In1885409057) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out1885409057) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1885409057, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1885409057} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1885409057, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1885409057, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out1885409057|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 02:30:52,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In566260808 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In566260808 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In566260808 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In566260808 256) 0))) (or (and (= 0 |P3Thread1of1ForFork1_#t~ite31_Out566260808|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd4~0_In566260808 |P3Thread1of1ForFork1_#t~ite31_Out566260808|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In566260808, ~z$w_buff0_used~0=~z$w_buff0_used~0_In566260808, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In566260808, ~z$w_buff1_used~0=~z$w_buff1_used~0_In566260808} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In566260808, ~z$w_buff0_used~0=~z$w_buff0_used~0_In566260808, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In566260808, ~z$w_buff1_used~0=~z$w_buff1_used~0_In566260808, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out566260808|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 02:30:52,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= v_~z$r_buff1_thd4~0_56 |v_P3Thread1of1ForFork1_#t~ite31_60|) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_60|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_56, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_59|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 02:30:52,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L847-1-->L853: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 4 v_~__unbuffered_cnt~0_60)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:30:52,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1263462063 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1263462063 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1263462063 |ULTIMATE.start_main_#t~ite36_Out1263462063|)) (and (or .cse1 .cse0) (= ~z~0_In1263462063 |ULTIMATE.start_main_#t~ite36_Out1263462063|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1263462063, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1263462063, ~z$w_buff1~0=~z$w_buff1~0_In1263462063, ~z~0=~z~0_In1263462063} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1263462063, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1263462063, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1263462063|, ~z$w_buff1~0=~z$w_buff1~0_In1263462063, ~z~0=~z~0_In1263462063} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 02:30:52,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L853-4-->L854: Formula: (= v_~z~0_38 |v_ULTIMATE.start_main_#t~ite36_16|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-27 02:30:52,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In5476760 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In5476760 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out5476760|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In5476760 |ULTIMATE.start_main_#t~ite38_Out5476760|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In5476760, ~z$w_buff0_used~0=~z$w_buff0_used~0_In5476760} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In5476760, ~z$w_buff0_used~0=~z$w_buff0_used~0_In5476760, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out5476760|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 02:30:52,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-427778829 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-427778829 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-427778829 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-427778829 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-427778829| ~z$w_buff1_used~0_In-427778829) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite39_Out-427778829| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-427778829, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-427778829, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-427778829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-427778829} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-427778829, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-427778829|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-427778829, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-427778829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-427778829} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 02:30:52,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1471937779 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1471937779 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite40_Out1471937779|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1471937779| ~z$r_buff0_thd0~0_In1471937779) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1471937779, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1471937779} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1471937779, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1471937779|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1471937779} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 02:30:52,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2145822420 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-2145822420 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-2145822420 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-2145822420 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite41_Out-2145822420| 0)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-2145822420 |ULTIMATE.start_main_#t~ite41_Out-2145822420|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2145822420, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2145822420, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2145822420, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2145822420} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-2145822420|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2145822420, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2145822420, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2145822420, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2145822420} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 02:30:52,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_73) (= 0 v_~__unbuffered_p3_EBX~0_72) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~z$r_buff1_thd0~0_110 |v_ULTIMATE.start_main_#t~ite41_51|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~x~0_52 2) (= v_~main$tmp_guard1~0_23 0) (= v_~y~0_52 2)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_110, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:30:52,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:30:52 BasicIcfg [2019-12-27 02:30:52,248 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:30:52,250 INFO L168 Benchmark]: Toolchain (without parser) took 20724.22 ms. Allocated memory was 144.2 MB in the beginning and 1.0 GB in the end (delta: 897.1 MB). Free memory was 99.3 MB in the beginning and 358.3 MB in the end (delta: -259.0 MB). Peak memory consumption was 638.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:30:52,250 INFO L168 Benchmark]: CDTParser took 1.92 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 02:30:52,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.39 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 98.9 MB in the beginning and 155.6 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 02:30:52,252 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.90 ms. Allocated memory is still 201.9 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:30:52,253 INFO L168 Benchmark]: Boogie Preprocessor took 54.88 ms. Allocated memory is still 201.9 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:30:52,253 INFO L168 Benchmark]: RCFGBuilder took 820.54 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 104.8 MB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:30:52,254 INFO L168 Benchmark]: TraceAbstraction took 19033.22 ms. Allocated memory was 201.9 MB in the beginning and 1.0 GB in the end (delta: 839.4 MB). Free memory was 104.1 MB in the beginning and 358.3 MB in the end (delta: -254.2 MB). Peak memory consumption was 585.2 MB. Max. memory is 7.1 GB. [2019-12-27 02:30:52,259 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.92 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.39 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 98.9 MB in the beginning and 155.6 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.90 ms. Allocated memory is still 201.9 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.88 ms. Allocated memory is still 201.9 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 820.54 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 104.8 MB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19033.22 ms. Allocated memory was 201.9 MB in the beginning and 1.0 GB in the end (delta: 839.4 MB). Free memory was 104.1 MB in the beginning and 358.3 MB in the end (delta: -254.2 MB). Peak memory consumption was 585.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 169 ProgramPointsBefore, 79 ProgramPointsAfterwards, 191 TransitionsBefore, 83 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 23 ChoiceCompositions, 5572 VarBasedMoverChecksPositive, 186 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 165 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 46301 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t1085, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t1086, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1087, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1088, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 [L809] 4 a = 1 [L812] 4 __unbuffered_p3_EAX = a [L815] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L819] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L820] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L856] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 18.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1764 SDtfs, 1853 SDslu, 3189 SDs, 0 SdLazy, 1482 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27254occurred 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.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 3846 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 533 NumberOfCodeBlocks, 533 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 470 ConstructedInterpolants, 0 QuantifiedInterpolants, 56089 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...