/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:55:27,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:55:27,103 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:55:27,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:55:27,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:55:27,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:55:27,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:55:27,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:55:27,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:55:27,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:55:27,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:55:27,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:55:27,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:55:27,126 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:55:27,127 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:55:27,128 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:55:27,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:55:27,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:55:27,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:55:27,134 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:55:27,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:55:27,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:55:27,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:55:27,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:55:27,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:55:27,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:55:27,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:55:27,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:55:27,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:55:27,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:55:27,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:55:27,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:55:27,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:55:27,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:55:27,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:55:27,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:55:27,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:55:27,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:55:27,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:55:27,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:55:27,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:55:27,152 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:55:27,174 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:55:27,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:55:27,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:55:27,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:55:27,178 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:55:27,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:55:27,179 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:55:27,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:55:27,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:55:27,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:55:27,180 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:55:27,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:55:27,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:55:27,182 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:55:27,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:55:27,182 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:55:27,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:55:27,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:55:27,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:55:27,183 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:55:27,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:55:27,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:55:27,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:55:27,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:55:27,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:55:27,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:55:27,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:55:27,186 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:55:27,186 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:55:27,187 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:55:27,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:55:27,479 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:55:27,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:55:27,484 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:55:27,485 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:55:27,485 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_pso.opt.i [2019-12-18 20:55:27,563 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c0f8249c/e554f7ddcbe74a548822fbce75fba7a5/FLAG35b5fb35d [2019-12-18 20:55:28,135 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:55:28,136 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_pso.opt.i [2019-12-18 20:55:28,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c0f8249c/e554f7ddcbe74a548822fbce75fba7a5/FLAG35b5fb35d [2019-12-18 20:55:28,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c0f8249c/e554f7ddcbe74a548822fbce75fba7a5 [2019-12-18 20:55:28,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:55:28,423 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:55:28,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:55:28,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:55:28,428 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:55:28,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:55:28" (1/1) ... [2019-12-18 20:55:28,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b27eebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:28, skipping insertion in model container [2019-12-18 20:55:28,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:55:28" (1/1) ... [2019-12-18 20:55:28,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:55:28,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:55:29,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:55:29,132 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:55:29,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:55:29,285 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:55:29,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:29 WrapperNode [2019-12-18 20:55:29,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:55:29,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:55:29,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:55:29,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:55:29,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:29" (1/1) ... [2019-12-18 20:55:29,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:29" (1/1) ... [2019-12-18 20:55:29,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:55:29,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:55:29,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:55:29,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:55:29,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:29" (1/1) ... [2019-12-18 20:55:29,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:29" (1/1) ... [2019-12-18 20:55:29,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:29" (1/1) ... [2019-12-18 20:55:29,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:29" (1/1) ... [2019-12-18 20:55:29,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:29" (1/1) ... [2019-12-18 20:55:29,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:29" (1/1) ... [2019-12-18 20:55:29,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:29" (1/1) ... [2019-12-18 20:55:29,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:55:29,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:55:29,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:55:29,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:55:29,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:55:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:55:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:55:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:55:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:55:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:55:29,475 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:55:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:55:29,475 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:55:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:55:29,476 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:55:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 20:55:29,476 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 20:55:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:55:29,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:55:29,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:55:29,479 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:55:30,229 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:55:30,230 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:55:30,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:55:30 BoogieIcfgContainer [2019-12-18 20:55:30,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:55:30,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:55:30,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:55:30,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:55:30,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:55:28" (1/3) ... [2019-12-18 20:55:30,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7174266c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:55:30, skipping insertion in model container [2019-12-18 20:55:30,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:29" (2/3) ... [2019-12-18 20:55:30,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7174266c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:55:30, skipping insertion in model container [2019-12-18 20:55:30,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:55:30" (3/3) ... [2019-12-18 20:55:30,241 INFO L109 eAbstractionObserver]: Analyzing ICFG mix027_pso.opt.i [2019-12-18 20:55:30,252 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:55:30,252 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:55:30,261 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:55:30,262 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:55:30,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,307 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,307 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,311 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,311 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,362 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,362 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,369 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,369 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,370 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,377 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,377 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,377 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,378 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,378 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,378 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,378 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,378 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,379 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,379 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,379 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,379 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,379 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,380 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,380 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,380 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,380 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,380 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,381 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,381 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,381 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,381 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,381 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,382 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,382 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,382 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,382 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,382 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,383 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,383 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,387 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,388 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,388 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,388 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,389 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,390 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,390 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,390 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,390 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,390 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,396 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,396 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,401 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,403 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,408 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,408 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,408 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:55:30,426 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 20:55:30,446 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:55:30,447 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:55:30,447 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:55:30,447 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:55:30,447 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:55:30,447 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:55:30,447 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:55:30,448 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:55:30,465 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-18 20:55:30,467 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 20:55:30,575 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 20:55:30,575 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:55:30,604 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 20:55:30,635 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 20:55:30,700 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 20:55:30,701 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:55:30,709 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 20:55:30,730 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 20:55:30,732 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:55:33,880 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-12-18 20:55:34,643 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 20:55:34,800 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 20:55:34,823 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78681 [2019-12-18 20:55:34,823 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-18 20:55:34,827 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 99 transitions [2019-12-18 20:56:20,003 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 188550 states. [2019-12-18 20:56:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 188550 states. [2019-12-18 20:56:20,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 20:56:20,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:56:20,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:56:20,015 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:56:20,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:56:20,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1081112205, now seen corresponding path program 1 times [2019-12-18 20:56:20,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:56:20,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552531419] [2019-12-18 20:56:20,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:56:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:56:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:56:20,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552531419] [2019-12-18 20:56:20,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:56:20,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:56:20,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696672046] [2019-12-18 20:56:20,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:56:20,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:56:20,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:56:20,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:56:20,322 INFO L87 Difference]: Start difference. First operand 188550 states. Second operand 3 states. [2019-12-18 20:56:24,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:56:24,490 INFO L93 Difference]: Finished difference Result 175078 states and 839564 transitions. [2019-12-18 20:56:24,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:56:24,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 20:56:24,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:56:29,281 INFO L225 Difference]: With dead ends: 175078 [2019-12-18 20:56:29,281 INFO L226 Difference]: Without dead ends: 164262 [2019-12-18 20:56:29,288 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-18 20:56:35,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164262 states. [2019-12-18 20:56:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164262 to 164262. [2019-12-18 20:56:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164262 states. [2019-12-18 20:56:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164262 states to 164262 states and 786680 transitions. [2019-12-18 20:56:46,954 INFO L78 Accepts]: Start accepts. Automaton has 164262 states and 786680 transitions. Word has length 7 [2019-12-18 20:56:46,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:56:46,955 INFO L462 AbstractCegarLoop]: Abstraction has 164262 states and 786680 transitions. [2019-12-18 20:56:46,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:56:46,955 INFO L276 IsEmpty]: Start isEmpty. Operand 164262 states and 786680 transitions. [2019-12-18 20:56:46,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 20:56:46,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:56:46,973 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:56:46,973 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:56:46,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:56:46,974 INFO L82 PathProgramCache]: Analyzing trace with hash -983624590, now seen corresponding path program 1 times [2019-12-18 20:56:46,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:56:46,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870058137] [2019-12-18 20:56:46,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:56:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:56:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:56:47,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870058137] [2019-12-18 20:56:47,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:56:47,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:56:47,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265236261] [2019-12-18 20:56:47,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:56:47,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:56:47,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:56:47,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:56:47,138 INFO L87 Difference]: Start difference. First operand 164262 states and 786680 transitions. Second operand 4 states. [2019-12-18 20:56:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:56:55,527 INFO L93 Difference]: Finished difference Result 260206 states and 1199142 transitions. [2019-12-18 20:56:55,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:56:55,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 20:56:55,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:56:56,436 INFO L225 Difference]: With dead ends: 260206 [2019-12-18 20:56:56,436 INFO L226 Difference]: Without dead ends: 259982 [2019-12-18 20:56:56,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:57:05,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259982 states. [2019-12-18 20:57:12,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259982 to 241474. [2019-12-18 20:57:12,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241474 states. [2019-12-18 20:57:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241474 states to 241474 states and 1122210 transitions. [2019-12-18 20:57:26,161 INFO L78 Accepts]: Start accepts. Automaton has 241474 states and 1122210 transitions. Word has length 15 [2019-12-18 20:57:26,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:57:26,161 INFO L462 AbstractCegarLoop]: Abstraction has 241474 states and 1122210 transitions. [2019-12-18 20:57:26,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:57:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 241474 states and 1122210 transitions. [2019-12-18 20:57:26,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 20:57:26,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:57:26,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:57:26,166 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:57:26,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:57:26,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1733643067, now seen corresponding path program 1 times [2019-12-18 20:57:26,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:57:26,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805601196] [2019-12-18 20:57:26,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:57:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:57:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:57:26,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805601196] [2019-12-18 20:57:26,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:57:26,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:57:26,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961997415] [2019-12-18 20:57:26,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:57:26,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:57:26,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:57:26,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:57:26,221 INFO L87 Difference]: Start difference. First operand 241474 states and 1122210 transitions. Second operand 3 states. [2019-12-18 20:57:26,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:57:26,995 INFO L93 Difference]: Finished difference Result 150344 states and 629507 transitions. [2019-12-18 20:57:26,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:57:26,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 20:57:26,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:57:27,689 INFO L225 Difference]: With dead ends: 150344 [2019-12-18 20:57:27,689 INFO L226 Difference]: Without dead ends: 150344 [2019-12-18 20:57:27,690 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-18 20:57:39,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150344 states. [2019-12-18 20:57:41,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150344 to 150344. [2019-12-18 20:57:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150344 states. [2019-12-18 20:57:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150344 states to 150344 states and 629507 transitions. [2019-12-18 20:57:43,176 INFO L78 Accepts]: Start accepts. Automaton has 150344 states and 629507 transitions. Word has length 15 [2019-12-18 20:57:43,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:57:43,176 INFO L462 AbstractCegarLoop]: Abstraction has 150344 states and 629507 transitions. [2019-12-18 20:57:43,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:57:43,176 INFO L276 IsEmpty]: Start isEmpty. Operand 150344 states and 629507 transitions. [2019-12-18 20:57:43,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:57:43,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:57:43,182 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:57:43,182 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:57:43,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:57:43,183 INFO L82 PathProgramCache]: Analyzing trace with hash 763013226, now seen corresponding path program 1 times [2019-12-18 20:57:43,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:57:43,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560390366] [2019-12-18 20:57:43,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:57:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:57:43,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:57:43,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560390366] [2019-12-18 20:57:43,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:57:43,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:57:43,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28758090] [2019-12-18 20:57:43,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:57:43,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:57:43,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:57:43,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:57:43,291 INFO L87 Difference]: Start difference. First operand 150344 states and 629507 transitions. Second operand 4 states. [2019-12-18 20:57:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:57:43,483 INFO L93 Difference]: Finished difference Result 41318 states and 147207 transitions. [2019-12-18 20:57:43,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:57:43,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:57:43,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:57:43,568 INFO L225 Difference]: With dead ends: 41318 [2019-12-18 20:57:43,568 INFO L226 Difference]: Without dead ends: 41318 [2019-12-18 20:57:43,569 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-18 20:57:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41318 states. [2019-12-18 20:57:45,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41318 to 41318. [2019-12-18 20:57:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41318 states. [2019-12-18 20:57:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41318 states to 41318 states and 147207 transitions. [2019-12-18 20:57:45,441 INFO L78 Accepts]: Start accepts. Automaton has 41318 states and 147207 transitions. Word has length 16 [2019-12-18 20:57:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:57:45,442 INFO L462 AbstractCegarLoop]: Abstraction has 41318 states and 147207 transitions. [2019-12-18 20:57:45,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:57:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 41318 states and 147207 transitions. [2019-12-18 20:57:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:57:45,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:57:45,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:57:45,445 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:57:45,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:57:45,445 INFO L82 PathProgramCache]: Analyzing trace with hash -613707051, now seen corresponding path program 1 times [2019-12-18 20:57:45,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:57:45,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592582900] [2019-12-18 20:57:45,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:57:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:57:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:57:45,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592582900] [2019-12-18 20:57:45,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:57:45,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:57:45,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112670810] [2019-12-18 20:57:45,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:57:45,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:57:45,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:57:45,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:57:45,547 INFO L87 Difference]: Start difference. First operand 41318 states and 147207 transitions. Second operand 5 states. [2019-12-18 20:57:46,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:57:46,123 INFO L93 Difference]: Finished difference Result 59208 states and 207429 transitions. [2019-12-18 20:57:46,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:57:46,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 20:57:46,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:57:46,248 INFO L225 Difference]: With dead ends: 59208 [2019-12-18 20:57:46,249 INFO L226 Difference]: Without dead ends: 59190 [2019-12-18 20:57:46,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:57:46,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59190 states. [2019-12-18 20:57:50,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59190 to 47448. [2019-12-18 20:57:50,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47448 states. [2019-12-18 20:57:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47448 states to 47448 states and 168412 transitions. [2019-12-18 20:57:50,517 INFO L78 Accepts]: Start accepts. Automaton has 47448 states and 168412 transitions. Word has length 16 [2019-12-18 20:57:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:57:50,517 INFO L462 AbstractCegarLoop]: Abstraction has 47448 states and 168412 transitions. [2019-12-18 20:57:50,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:57:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 47448 states and 168412 transitions. [2019-12-18 20:57:50,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 20:57:50,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:57:50,538 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:57:50,538 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:57:50,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:57:50,538 INFO L82 PathProgramCache]: Analyzing trace with hash -671023088, now seen corresponding path program 1 times [2019-12-18 20:57:50,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:57:50,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969430714] [2019-12-18 20:57:50,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:57:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:57:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:57:50,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969430714] [2019-12-18 20:57:50,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:57:50,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:57:50,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118887937] [2019-12-18 20:57:50,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:57:50,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:57:50,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:57:50,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:57:50,685 INFO L87 Difference]: Start difference. First operand 47448 states and 168412 transitions. Second operand 6 states. [2019-12-18 20:57:51,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:57:51,692 INFO L93 Difference]: Finished difference Result 74089 states and 256860 transitions. [2019-12-18 20:57:51,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:57:51,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 20:57:51,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:57:51,886 INFO L225 Difference]: With dead ends: 74089 [2019-12-18 20:57:51,886 INFO L226 Difference]: Without dead ends: 74059 [2019-12-18 20:57:51,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:57:52,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74059 states. [2019-12-18 20:57:53,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74059 to 51590. [2019-12-18 20:57:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51590 states. [2019-12-18 20:57:53,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51590 states to 51590 states and 182170 transitions. [2019-12-18 20:57:53,476 INFO L78 Accepts]: Start accepts. Automaton has 51590 states and 182170 transitions. Word has length 24 [2019-12-18 20:57:53,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:57:53,477 INFO L462 AbstractCegarLoop]: Abstraction has 51590 states and 182170 transitions. [2019-12-18 20:57:53,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:57:53,477 INFO L276 IsEmpty]: Start isEmpty. Operand 51590 states and 182170 transitions. [2019-12-18 20:57:53,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 20:57:53,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:57:53,494 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:57:53,494 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:57:53,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:57:53,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1890536022, now seen corresponding path program 2 times [2019-12-18 20:57:53,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:57:53,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198556536] [2019-12-18 20:57:53,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:57:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:57:53,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:57:53,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198556536] [2019-12-18 20:57:53,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:57:53,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:57:53,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976980118] [2019-12-18 20:57:53,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:57:53,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:57:53,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:57:53,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:57:53,627 INFO L87 Difference]: Start difference. First operand 51590 states and 182170 transitions. Second operand 6 states. [2019-12-18 20:57:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:57:54,719 INFO L93 Difference]: Finished difference Result 74803 states and 257982 transitions. [2019-12-18 20:57:54,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:57:54,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 20:57:54,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:57:54,874 INFO L225 Difference]: With dead ends: 74803 [2019-12-18 20:57:54,875 INFO L226 Difference]: Without dead ends: 74773 [2019-12-18 20:57:54,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:57:55,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74773 states. [2019-12-18 20:57:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74773 to 49188. [2019-12-18 20:57:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49188 states. [2019-12-18 20:57:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49188 states to 49188 states and 173259 transitions. [2019-12-18 20:57:56,559 INFO L78 Accepts]: Start accepts. Automaton has 49188 states and 173259 transitions. Word has length 24 [2019-12-18 20:57:56,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:57:56,559 INFO L462 AbstractCegarLoop]: Abstraction has 49188 states and 173259 transitions. [2019-12-18 20:57:56,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:57:56,559 INFO L276 IsEmpty]: Start isEmpty. Operand 49188 states and 173259 transitions. [2019-12-18 20:57:56,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:57:56,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:57:56,587 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:57:56,587 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:57:56,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:57:56,588 INFO L82 PathProgramCache]: Analyzing trace with hash -477366327, now seen corresponding path program 1 times [2019-12-18 20:57:56,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:57:56,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748760461] [2019-12-18 20:57:56,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:57:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:57:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:57:56,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748760461] [2019-12-18 20:57:56,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:57:56,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:57:56,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926577228] [2019-12-18 20:57:56,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:57:56,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:57:56,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:57:56,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:57:56,680 INFO L87 Difference]: Start difference. First operand 49188 states and 173259 transitions. Second operand 5 states. [2019-12-18 20:57:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:57:56,891 INFO L93 Difference]: Finished difference Result 26846 states and 95897 transitions. [2019-12-18 20:57:56,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:57:56,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 20:57:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:57:56,964 INFO L225 Difference]: With dead ends: 26846 [2019-12-18 20:57:56,965 INFO L226 Difference]: Without dead ends: 26846 [2019-12-18 20:57:56,965 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-18 20:57:57,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26846 states. [2019-12-18 20:57:57,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26846 to 26446. [2019-12-18 20:57:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26446 states. [2019-12-18 20:57:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26446 states to 26446 states and 94537 transitions. [2019-12-18 20:57:57,776 INFO L78 Accepts]: Start accepts. Automaton has 26446 states and 94537 transitions. Word has length 28 [2019-12-18 20:57:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:57:57,776 INFO L462 AbstractCegarLoop]: Abstraction has 26446 states and 94537 transitions. [2019-12-18 20:57:57,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:57:57,777 INFO L276 IsEmpty]: Start isEmpty. Operand 26446 states and 94537 transitions. [2019-12-18 20:57:57,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 20:57:57,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:57:57,822 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] [2019-12-18 20:57:57,822 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:57:57,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:57:57,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1943183858, now seen corresponding path program 1 times [2019-12-18 20:57:57,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:57:57,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024027357] [2019-12-18 20:57:57,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:57:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:57:57,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:57:57,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024027357] [2019-12-18 20:57:57,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:57:57,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:57:57,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964455324] [2019-12-18 20:57:57,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:57:57,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:57:57,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:57:57,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:57:57,898 INFO L87 Difference]: Start difference. First operand 26446 states and 94537 transitions. Second operand 3 states. [2019-12-18 20:57:58,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:57:58,116 INFO L93 Difference]: Finished difference Result 39888 states and 135979 transitions. [2019-12-18 20:57:58,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:57:58,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-18 20:57:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:57:58,199 INFO L225 Difference]: With dead ends: 39888 [2019-12-18 20:57:58,199 INFO L226 Difference]: Without dead ends: 26945 [2019-12-18 20:57:58,200 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-18 20:57:58,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26945 states. [2019-12-18 20:57:58,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26945 to 26508. [2019-12-18 20:57:58,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26508 states. [2019-12-18 20:57:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26508 states to 26508 states and 82548 transitions. [2019-12-18 20:57:58,914 INFO L78 Accepts]: Start accepts. Automaton has 26508 states and 82548 transitions. Word has length 42 [2019-12-18 20:57:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:57:58,914 INFO L462 AbstractCegarLoop]: Abstraction has 26508 states and 82548 transitions. [2019-12-18 20:57:58,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:57:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 26508 states and 82548 transitions. [2019-12-18 20:57:58,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 20:57:58,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:57:58,952 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] [2019-12-18 20:57:58,952 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:57:58,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:57:58,952 INFO L82 PathProgramCache]: Analyzing trace with hash -842084234, now seen corresponding path program 1 times [2019-12-18 20:57:58,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:57:58,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392472725] [2019-12-18 20:57:58,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:57:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:57:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:57:59,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392472725] [2019-12-18 20:57:59,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:57:59,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:57:59,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157454864] [2019-12-18 20:57:59,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:57:59,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:57:59,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:57:59,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:57:59,033 INFO L87 Difference]: Start difference. First operand 26508 states and 82548 transitions. Second operand 6 states. [2019-12-18 20:57:59,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:57:59,192 INFO L93 Difference]: Finished difference Result 25159 states and 79138 transitions. [2019-12-18 20:57:59,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:57:59,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-18 20:57:59,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:57:59,212 INFO L225 Difference]: With dead ends: 25159 [2019-12-18 20:57:59,212 INFO L226 Difference]: Without dead ends: 12897 [2019-12-18 20:57:59,212 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-18 20:57:59,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12897 states. [2019-12-18 20:57:59,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12897 to 12484. [2019-12-18 20:57:59,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12484 states. [2019-12-18 20:57:59,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12484 states to 12484 states and 39095 transitions. [2019-12-18 20:57:59,419 INFO L78 Accepts]: Start accepts. Automaton has 12484 states and 39095 transitions. Word has length 43 [2019-12-18 20:57:59,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:57:59,420 INFO L462 AbstractCegarLoop]: Abstraction has 12484 states and 39095 transitions. [2019-12-18 20:57:59,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:57:59,420 INFO L276 IsEmpty]: Start isEmpty. Operand 12484 states and 39095 transitions. [2019-12-18 20:57:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:57:59,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:57:59,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:57:59,598 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:57:59,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:57:59,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1618282670, now seen corresponding path program 1 times [2019-12-18 20:57:59,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:57:59,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234900882] [2019-12-18 20:57:59,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:57:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:57:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:57:59,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234900882] [2019-12-18 20:57:59,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:57:59,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:57:59,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152341478] [2019-12-18 20:57:59,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:57:59,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:57:59,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:57:59,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:57:59,664 INFO L87 Difference]: Start difference. First operand 12484 states and 39095 transitions. Second operand 3 states. [2019-12-18 20:57:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:57:59,769 INFO L93 Difference]: Finished difference Result 16821 states and 51803 transitions. [2019-12-18 20:57:59,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:57:59,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 20:57:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:57:59,803 INFO L225 Difference]: With dead ends: 16821 [2019-12-18 20:57:59,803 INFO L226 Difference]: Without dead ends: 16821 [2019-12-18 20:57:59,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:57:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16821 states. [2019-12-18 20:58:00,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16821 to 13740. [2019-12-18 20:58:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13740 states. [2019-12-18 20:58:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13740 states to 13740 states and 42926 transitions. [2019-12-18 20:58:00,251 INFO L78 Accepts]: Start accepts. Automaton has 13740 states and 42926 transitions. Word has length 57 [2019-12-18 20:58:00,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:00,251 INFO L462 AbstractCegarLoop]: Abstraction has 13740 states and 42926 transitions. [2019-12-18 20:58:00,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:58:00,251 INFO L276 IsEmpty]: Start isEmpty. Operand 13740 states and 42926 transitions. [2019-12-18 20:58:00,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:58:00,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:00,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:58:00,279 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:58:00,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:00,280 INFO L82 PathProgramCache]: Analyzing trace with hash 387764161, now seen corresponding path program 1 times [2019-12-18 20:58:00,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:00,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693247465] [2019-12-18 20:58:00,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:00,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:58:00,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693247465] [2019-12-18 20:58:00,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:00,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:58:00,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227747688] [2019-12-18 20:58:00,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:58:00,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:00,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:58:00,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:58:00,389 INFO L87 Difference]: Start difference. First operand 13740 states and 42926 transitions. Second operand 4 states. [2019-12-18 20:58:00,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:00,504 INFO L93 Difference]: Finished difference Result 24889 states and 77727 transitions. [2019-12-18 20:58:00,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:58:00,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-18 20:58:00,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:00,529 INFO L225 Difference]: With dead ends: 24889 [2019-12-18 20:58:00,529 INFO L226 Difference]: Without dead ends: 11471 [2019-12-18 20:58:00,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:58:00,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11471 states. [2019-12-18 20:58:00,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11471 to 11471. [2019-12-18 20:58:00,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11471 states. [2019-12-18 20:58:00,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11471 states to 11471 states and 35689 transitions. [2019-12-18 20:58:00,765 INFO L78 Accepts]: Start accepts. Automaton has 11471 states and 35689 transitions. Word has length 57 [2019-12-18 20:58:00,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:00,765 INFO L462 AbstractCegarLoop]: Abstraction has 11471 states and 35689 transitions. [2019-12-18 20:58:00,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:58:00,765 INFO L276 IsEmpty]: Start isEmpty. Operand 11471 states and 35689 transitions. [2019-12-18 20:58:00,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:58:00,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:00,783 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:58:00,783 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:58:00,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:00,784 INFO L82 PathProgramCache]: Analyzing trace with hash 952511363, now seen corresponding path program 2 times [2019-12-18 20:58:00,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:00,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805622486] [2019-12-18 20:58:00,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:00,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:58:00,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805622486] [2019-12-18 20:58:00,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:00,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:58:00,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839073911] [2019-12-18 20:58:00,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:58:00,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:00,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:58:00,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:58:00,873 INFO L87 Difference]: Start difference. First operand 11471 states and 35689 transitions. Second operand 7 states. [2019-12-18 20:58:01,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:01,315 INFO L93 Difference]: Finished difference Result 31961 states and 99026 transitions. [2019-12-18 20:58:01,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:58:01,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 20:58:01,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:01,354 INFO L225 Difference]: With dead ends: 31961 [2019-12-18 20:58:01,355 INFO L226 Difference]: Without dead ends: 25025 [2019-12-18 20:58:01,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:58:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25025 states. [2019-12-18 20:58:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25025 to 14643. [2019-12-18 20:58:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14643 states. [2019-12-18 20:58:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14643 states to 14643 states and 45925 transitions. [2019-12-18 20:58:01,678 INFO L78 Accepts]: Start accepts. Automaton has 14643 states and 45925 transitions. Word has length 57 [2019-12-18 20:58:01,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:01,678 INFO L462 AbstractCegarLoop]: Abstraction has 14643 states and 45925 transitions. [2019-12-18 20:58:01,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:58:01,678 INFO L276 IsEmpty]: Start isEmpty. Operand 14643 states and 45925 transitions. [2019-12-18 20:58:01,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:58:01,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:01,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:58:01,702 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:58:01,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:01,702 INFO L82 PathProgramCache]: Analyzing trace with hash -892256369, now seen corresponding path program 3 times [2019-12-18 20:58:01,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:01,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828713479] [2019-12-18 20:58:01,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:58:01,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828713479] [2019-12-18 20:58:01,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:01,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:58:01,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036361943] [2019-12-18 20:58:01,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:58:01,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:01,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:58:01,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:58:01,793 INFO L87 Difference]: Start difference. First operand 14643 states and 45925 transitions. Second operand 6 states. [2019-12-18 20:58:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:02,270 INFO L93 Difference]: Finished difference Result 37703 states and 115325 transitions. [2019-12-18 20:58:02,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:58:02,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-18 20:58:02,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:02,312 INFO L225 Difference]: With dead ends: 37703 [2019-12-18 20:58:02,312 INFO L226 Difference]: Without dead ends: 27294 [2019-12-18 20:58:02,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:58:02,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27294 states. [2019-12-18 20:58:02,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27294 to 17260. [2019-12-18 20:58:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17260 states. [2019-12-18 20:58:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17260 states to 17260 states and 54084 transitions. [2019-12-18 20:58:02,675 INFO L78 Accepts]: Start accepts. Automaton has 17260 states and 54084 transitions. Word has length 57 [2019-12-18 20:58:02,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:02,675 INFO L462 AbstractCegarLoop]: Abstraction has 17260 states and 54084 transitions. [2019-12-18 20:58:02,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:58:02,675 INFO L276 IsEmpty]: Start isEmpty. Operand 17260 states and 54084 transitions. [2019-12-18 20:58:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:58:02,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:02,695 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:58:02,695 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:58:02,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:02,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2087351501, now seen corresponding path program 4 times [2019-12-18 20:58:02,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:02,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114345464] [2019-12-18 20:58:02,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:58:02,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114345464] [2019-12-18 20:58:02,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:02,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:58:02,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250615585] [2019-12-18 20:58:02,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:58:02,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:02,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:58:02,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:58:02,800 INFO L87 Difference]: Start difference. First operand 17260 states and 54084 transitions. Second operand 7 states. [2019-12-18 20:58:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:03,212 INFO L93 Difference]: Finished difference Result 30486 states and 92723 transitions. [2019-12-18 20:58:03,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 20:58:03,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 20:58:03,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:03,258 INFO L225 Difference]: With dead ends: 30486 [2019-12-18 20:58:03,258 INFO L226 Difference]: Without dead ends: 28427 [2019-12-18 20:58:03,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:58:03,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28427 states. [2019-12-18 20:58:03,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28427 to 17324. [2019-12-18 20:58:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17324 states. [2019-12-18 20:58:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17324 states to 17324 states and 54315 transitions. [2019-12-18 20:58:03,626 INFO L78 Accepts]: Start accepts. Automaton has 17324 states and 54315 transitions. Word has length 57 [2019-12-18 20:58:03,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:03,626 INFO L462 AbstractCegarLoop]: Abstraction has 17324 states and 54315 transitions. [2019-12-18 20:58:03,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:58:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand 17324 states and 54315 transitions. [2019-12-18 20:58:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:58:03,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:03,645 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:58:03,646 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:58:03,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:03,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1340364786, now seen corresponding path program 1 times [2019-12-18 20:58:03,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:03,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581372618] [2019-12-18 20:58:03,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:03,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:58:03,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581372618] [2019-12-18 20:58:03,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:03,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:58:03,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536052333] [2019-12-18 20:58:03,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:58:03,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:03,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:58:03,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:58:03,687 INFO L87 Difference]: Start difference. First operand 17324 states and 54315 transitions. Second operand 3 states. [2019-12-18 20:58:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:03,788 INFO L93 Difference]: Finished difference Result 19127 states and 58227 transitions. [2019-12-18 20:58:03,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:58:03,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 20:58:03,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:03,820 INFO L225 Difference]: With dead ends: 19127 [2019-12-18 20:58:03,820 INFO L226 Difference]: Without dead ends: 19127 [2019-12-18 20:58:03,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:58:03,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19127 states. [2019-12-18 20:58:04,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19127 to 17324. [2019-12-18 20:58:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17324 states. [2019-12-18 20:58:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17324 states to 17324 states and 53125 transitions. [2019-12-18 20:58:04,218 INFO L78 Accepts]: Start accepts. Automaton has 17324 states and 53125 transitions. Word has length 57 [2019-12-18 20:58:04,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:04,219 INFO L462 AbstractCegarLoop]: Abstraction has 17324 states and 53125 transitions. [2019-12-18 20:58:04,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:58:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 17324 states and 53125 transitions. [2019-12-18 20:58:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:58:04,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:04,239 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:58:04,239 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:58:04,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:04,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1476889779, now seen corresponding path program 5 times [2019-12-18 20:58:04,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:04,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545799477] [2019-12-18 20:58:04,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:58:04,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545799477] [2019-12-18 20:58:04,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:04,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:58:04,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573010105] [2019-12-18 20:58:04,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:58:04,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:04,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:58:04,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:58:04,322 INFO L87 Difference]: Start difference. First operand 17324 states and 53125 transitions. Second operand 7 states. [2019-12-18 20:58:04,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:04,708 INFO L93 Difference]: Finished difference Result 33840 states and 100860 transitions. [2019-12-18 20:58:04,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:58:04,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 20:58:04,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:04,760 INFO L225 Difference]: With dead ends: 33840 [2019-12-18 20:58:04,761 INFO L226 Difference]: Without dead ends: 28566 [2019-12-18 20:58:04,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:58:04,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28566 states. [2019-12-18 20:58:05,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28566 to 17534. [2019-12-18 20:58:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17534 states. [2019-12-18 20:58:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17534 states to 17534 states and 53712 transitions. [2019-12-18 20:58:05,130 INFO L78 Accepts]: Start accepts. Automaton has 17534 states and 53712 transitions. Word has length 57 [2019-12-18 20:58:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:05,130 INFO L462 AbstractCegarLoop]: Abstraction has 17534 states and 53712 transitions. [2019-12-18 20:58:05,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:58:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 17534 states and 53712 transitions. [2019-12-18 20:58:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:58:05,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:05,150 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:58:05,151 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:58:05,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:05,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2138440037, now seen corresponding path program 6 times [2019-12-18 20:58:05,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:05,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522620927] [2019-12-18 20:58:05,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:05,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:58:05,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522620927] [2019-12-18 20:58:05,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:05,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:58:05,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389622182] [2019-12-18 20:58:05,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:58:05,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:05,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:58:05,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:58:05,233 INFO L87 Difference]: Start difference. First operand 17534 states and 53712 transitions. Second operand 5 states. [2019-12-18 20:58:05,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:05,765 INFO L93 Difference]: Finished difference Result 27008 states and 80281 transitions. [2019-12-18 20:58:05,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:58:05,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 20:58:05,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:05,804 INFO L225 Difference]: With dead ends: 27008 [2019-12-18 20:58:05,804 INFO L226 Difference]: Without dead ends: 26882 [2019-12-18 20:58:05,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:58:05,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26882 states. [2019-12-18 20:58:06,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26882 to 20519. [2019-12-18 20:58:06,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20519 states. [2019-12-18 20:58:06,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20519 states to 20519 states and 62331 transitions. [2019-12-18 20:58:06,390 INFO L78 Accepts]: Start accepts. Automaton has 20519 states and 62331 transitions. Word has length 57 [2019-12-18 20:58:06,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:06,390 INFO L462 AbstractCegarLoop]: Abstraction has 20519 states and 62331 transitions. [2019-12-18 20:58:06,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:58:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand 20519 states and 62331 transitions. [2019-12-18 20:58:06,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:58:06,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:06,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:58:06,415 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:58:06,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:06,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2006747037, now seen corresponding path program 7 times [2019-12-18 20:58:06,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:06,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19103873] [2019-12-18 20:58:06,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:06,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:58:06,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19103873] [2019-12-18 20:58:06,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:06,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:58:06,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231275112] [2019-12-18 20:58:06,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:58:06,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:06,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:58:06,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:58:06,540 INFO L87 Difference]: Start difference. First operand 20519 states and 62331 transitions. Second operand 8 states. [2019-12-18 20:58:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:07,596 INFO L93 Difference]: Finished difference Result 27845 states and 82714 transitions. [2019-12-18 20:58:07,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 20:58:07,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-18 20:58:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:07,635 INFO L225 Difference]: With dead ends: 27845 [2019-12-18 20:58:07,636 INFO L226 Difference]: Without dead ends: 27845 [2019-12-18 20:58:07,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 20:58:07,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27845 states. [2019-12-18 20:58:07,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27845 to 20717. [2019-12-18 20:58:07,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20717 states. [2019-12-18 20:58:08,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20717 states to 20717 states and 62913 transitions. [2019-12-18 20:58:08,020 INFO L78 Accepts]: Start accepts. Automaton has 20717 states and 62913 transitions. Word has length 57 [2019-12-18 20:58:08,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:08,020 INFO L462 AbstractCegarLoop]: Abstraction has 20717 states and 62913 transitions. [2019-12-18 20:58:08,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:58:08,021 INFO L276 IsEmpty]: Start isEmpty. Operand 20717 states and 62913 transitions. [2019-12-18 20:58:08,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:58:08,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:08,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:58:08,054 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:58:08,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:08,055 INFO L82 PathProgramCache]: Analyzing trace with hash 546690713, now seen corresponding path program 8 times [2019-12-18 20:58:08,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:08,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260142593] [2019-12-18 20:58:08,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:58:08,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260142593] [2019-12-18 20:58:08,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:08,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:58:08,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689963949] [2019-12-18 20:58:08,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:58:08,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:08,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:58:08,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:58:08,113 INFO L87 Difference]: Start difference. First operand 20717 states and 62913 transitions. Second operand 3 states. [2019-12-18 20:58:08,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:08,190 INFO L93 Difference]: Finished difference Result 20717 states and 62911 transitions. [2019-12-18 20:58:08,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:58:08,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 20:58:08,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:08,221 INFO L225 Difference]: With dead ends: 20717 [2019-12-18 20:58:08,221 INFO L226 Difference]: Without dead ends: 20717 [2019-12-18 20:58:08,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:58:08,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20717 states. [2019-12-18 20:58:08,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20717 to 18485. [2019-12-18 20:58:08,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18485 states. [2019-12-18 20:58:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18485 states to 18485 states and 56780 transitions. [2019-12-18 20:58:08,529 INFO L78 Accepts]: Start accepts. Automaton has 18485 states and 56780 transitions. Word has length 57 [2019-12-18 20:58:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:08,529 INFO L462 AbstractCegarLoop]: Abstraction has 18485 states and 56780 transitions. [2019-12-18 20:58:08,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:58:08,529 INFO L276 IsEmpty]: Start isEmpty. Operand 18485 states and 56780 transitions. [2019-12-18 20:58:08,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 20:58:08,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:08,551 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:58:08,551 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:58:08,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:08,551 INFO L82 PathProgramCache]: Analyzing trace with hash -495925558, now seen corresponding path program 1 times [2019-12-18 20:58:08,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:08,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54114988] [2019-12-18 20:58:08,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:08,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:58:08,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54114988] [2019-12-18 20:58:08,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:08,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:58:08,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382189290] [2019-12-18 20:58:08,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:58:08,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:08,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:58:08,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:58:08,619 INFO L87 Difference]: Start difference. First operand 18485 states and 56780 transitions. Second operand 3 states. [2019-12-18 20:58:08,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:08,681 INFO L93 Difference]: Finished difference Result 13007 states and 39292 transitions. [2019-12-18 20:58:08,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:58:08,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 20:58:08,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:08,706 INFO L225 Difference]: With dead ends: 13007 [2019-12-18 20:58:08,706 INFO L226 Difference]: Without dead ends: 13007 [2019-12-18 20:58:08,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:58:08,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13007 states. [2019-12-18 20:58:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13007 to 12385. [2019-12-18 20:58:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12385 states. [2019-12-18 20:58:09,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12385 states to 12385 states and 37400 transitions. [2019-12-18 20:58:09,358 INFO L78 Accepts]: Start accepts. Automaton has 12385 states and 37400 transitions. Word has length 58 [2019-12-18 20:58:09,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:09,359 INFO L462 AbstractCegarLoop]: Abstraction has 12385 states and 37400 transitions. [2019-12-18 20:58:09,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:58:09,359 INFO L276 IsEmpty]: Start isEmpty. Operand 12385 states and 37400 transitions. [2019-12-18 20:58:09,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:58:09,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:09,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:58:09,388 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:58:09,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:09,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1514724949, now seen corresponding path program 1 times [2019-12-18 20:58:09,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:09,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487846834] [2019-12-18 20:58:09,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:58:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:58:09,538 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:58:09,538 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:58:09,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= v_~y$r_buff0_thd2~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_p3_EAX~0_15) (= |v_#NULL.offset_7| 0) (= 0 v_~y$w_buff1~0_24) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_40) (= |v_#memory_int_25| (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t725~0.base_22| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t725~0.base_22|) |v_ULTIMATE.start_main_~#t725~0.offset_17| 0))) (< 0 |v_#StackHeapBarrier_19|) (= v_~y$r_buff0_thd1~0_9 0) (= v_~main$tmp_guard1~0_21 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t725~0.base_22| 1)) (= 0 v_~__unbuffered_cnt~0_28) (= v_~y$r_buff1_thd1~0_8 0) (= v_~y$r_buff0_thd3~0_25 0) (= 0 v_~y$flush_delayed~0_12) (= v_~y$r_buff0_thd0~0_20 0) (= v_~z~0_16 0) (= v_~a~0_10 0) (= 0 v_~weak$$choice2~0_33) (= 0 v_~y$r_buff1_thd0~0_21) (= v_~x~0_18 0) (= 0 v_~weak$$choice0~0_7) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p3_EBX~0_15) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t725~0.base_22| 4)) (= 0 |v_#NULL.base_7|) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t725~0.base_22|) (= v_~y$w_buff1_used~0_67 0) (= v_~y$mem_tmp~0_10 0) (= 0 |v_ULTIMATE.start_main_~#t725~0.offset_17|) (= v_~y$r_buff0_thd4~0_19 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t725~0.base_22|) 0) (= v_~main$tmp_guard0~0_11 0) (= v_~y~0_26 0) (= 0 v_~y$r_buff1_thd4~0_18) (= 0 v_~__unbuffered_p1_EAX~0_16) (= 0 v_~y$r_buff1_thd3~0_16) (= v_~y$w_buff0_used~0_100 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_19|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t726~0.offset=|v_ULTIMATE.start_main_~#t726~0.offset_15|, ~a~0=v_~a~0_10, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_15, #length=|v_#length_27|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_7|, ULTIMATE.start_main_~#t727~0.offset=|v_ULTIMATE.start_main_~#t727~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_65, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_21, ~x~0=v_~x~0_18, ULTIMATE.start_main_~#t725~0.offset=|v_ULTIMATE.start_main_~#t725~0.offset_17|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t728~0.base=|v_ULTIMATE.start_main_~#t728~0.base_19|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_~#t728~0.offset=|v_ULTIMATE.start_main_~#t728~0.offset_15|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ULTIMATE.start_main_~#t725~0.base=|v_ULTIMATE.start_main_~#t725~0.base_22|, ~y~0=v_~y~0_26, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ULTIMATE.start_main_~#t727~0.base=|v_ULTIMATE.start_main_~#t727~0.base_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_15, #NULL.base=|v_#NULL.base_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_40, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_19, ULTIMATE.start_main_~#t726~0.base=|v_ULTIMATE.start_main_~#t726~0.base_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~z~0=v_~z~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t726~0.offset, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t727~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t725~0.offset, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t728~0.base, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t728~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t725~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t727~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t726~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:58:09,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L841-1-->L843: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t726~0.base_10| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t726~0.base_10|) |v_ULTIMATE.start_main_~#t726~0.offset_10| 1)) |v_#memory_int_21|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t726~0.base_10|) 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t726~0.base_10| 4) |v_#length_23|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t726~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t726~0.base_10| 0)) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t726~0.base_10| 1) |v_#valid_41|) (= 0 |v_ULTIMATE.start_main_~#t726~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t726~0.offset=|v_ULTIMATE.start_main_~#t726~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t726~0.base=|v_ULTIMATE.start_main_~#t726~0.base_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t726~0.offset, ULTIMATE.start_main_~#t726~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 20:58:09,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L843-1-->L845: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t727~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t727~0.offset_10|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t727~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t727~0.base_11|) |v_ULTIMATE.start_main_~#t727~0.offset_10| 2))) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t727~0.base_11| 4)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t727~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t727~0.base_11|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t727~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t727~0.offset=|v_ULTIMATE.start_main_~#t727~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t727~0.base=|v_ULTIMATE.start_main_~#t727~0.base_11|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t727~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t727~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 20:58:09,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L4-->L795: Formula: (and (= 1 v_~z~0_6) (= v_~y$r_buff0_thd3~0_21 v_~y$r_buff1_thd3~0_11) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff1_thd2~0_29) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd3~0_20 1) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_8 0)) (= v_~y$r_buff0_thd4~0_15 v_~y$r_buff1_thd4~0_13) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_12)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_21, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_8} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_29, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_11, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_20, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z~0=v_~z~0_6, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_12} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 20:58:09,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L845-1-->L847: Formula: (and (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t728~0.base_11|)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t728~0.base_11| 4) |v_#length_19|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t728~0.base_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t728~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t728~0.offset_10|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t728~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t728~0.base_11|) |v_ULTIMATE.start_main_~#t728~0.offset_10| 3)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t728~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t728~0.base=|v_ULTIMATE.start_main_~#t728~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t728~0.offset=|v_ULTIMATE.start_main_~#t728~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t728~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t728~0.offset] because there is no mapped edge [2019-12-18 20:58:09,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= 1 v_~a~0_5) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~x~0_8) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_5, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_8, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 20:58:09,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite33_Out-2074367458| |P3Thread1of1ForFork0_#t~ite32_Out-2074367458|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2074367458 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In-2074367458 256)))) (or (and .cse0 (= ~y$w_buff1~0_In-2074367458 |P3Thread1of1ForFork0_#t~ite32_Out-2074367458|) (not .cse1) (not .cse2)) (and (= |P3Thread1of1ForFork0_#t~ite32_Out-2074367458| ~y~0_In-2074367458) .cse0 (or .cse1 .cse2)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-2074367458, ~y$w_buff1~0=~y$w_buff1~0_In-2074367458, ~y~0=~y~0_In-2074367458, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2074367458} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-2074367458, ~y$w_buff1~0=~y$w_buff1~0_In-2074367458, ~y~0=~y~0_In-2074367458, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-2074367458|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-2074367458|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2074367458} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 20:58:09,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-196838104 256))) (.cse1 (= (mod ~y$r_buff0_thd4~0_In-196838104 256) 0))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out-196838104| 0)) (and (= |P3Thread1of1ForFork0_#t~ite34_Out-196838104| ~y$w_buff0_used~0_In-196838104) (or .cse0 .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-196838104, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-196838104} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-196838104, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-196838104, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-196838104|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 20:58:09,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1930325089 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In1930325089 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1930325089 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In1930325089 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1930325089 |P3Thread1of1ForFork0_#t~ite35_Out1930325089|)) (and (= |P3Thread1of1ForFork0_#t~ite35_Out1930325089| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1930325089, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1930325089, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1930325089, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1930325089} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1930325089, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1930325089, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1930325089, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out1930325089|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1930325089} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 20:58:09,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-862311869 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-862311869 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-862311869|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd4~0_In-862311869 |P3Thread1of1ForFork0_#t~ite36_Out-862311869|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-862311869, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-862311869} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-862311869, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-862311869, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-862311869|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 20:58:09,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In955859779 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In955859779 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In955859779 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd4~0_In955859779 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd4~0_In955859779 |P3Thread1of1ForFork0_#t~ite37_Out955859779|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out955859779|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In955859779, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In955859779, ~y$w_buff0_used~0=~y$w_buff0_used~0_In955859779, ~y$w_buff1_used~0=~y$w_buff1_used~0_In955859779} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In955859779, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In955859779, ~y$w_buff0_used~0=~y$w_buff0_used~0_In955859779, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out955859779|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In955859779} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 20:58:09,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= |v_P3Thread1of1ForFork0_#t~ite37_8| v_~y$r_buff1_thd4~0_14) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_14, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:58:09,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L760-->L760-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-423469130 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In-423469130 |P1Thread1of1ForFork2_#t~ite12_Out-423469130|) (= |P1Thread1of1ForFork2_#t~ite11_In-423469130| |P1Thread1of1ForFork2_#t~ite11_Out-423469130|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-423469130 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-423469130 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-423469130 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-423469130 256) 0)))) .cse0 (= |P1Thread1of1ForFork2_#t~ite11_Out-423469130| |P1Thread1of1ForFork2_#t~ite12_Out-423469130|) (= ~y$w_buff1~0_In-423469130 |P1Thread1of1ForFork2_#t~ite11_Out-423469130|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-423469130, ~y$w_buff1~0=~y$w_buff1~0_In-423469130, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-423469130, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-423469130, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-423469130|, ~weak$$choice2~0=~weak$$choice2~0_In-423469130, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-423469130} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-423469130, ~y$w_buff1~0=~y$w_buff1~0_In-423469130, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-423469130, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-423469130, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-423469130|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-423469130|, ~weak$$choice2~0=~weak$$choice2~0_In-423469130, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-423469130} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 20:58:09,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L761-->L761-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1580965555 256)))) (or (and (= ~y$w_buff0_used~0_In-1580965555 |P1Thread1of1ForFork2_#t~ite15_Out-1580965555|) (= |P1Thread1of1ForFork2_#t~ite14_In-1580965555| |P1Thread1of1ForFork2_#t~ite14_Out-1580965555|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1580965555 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1580965555 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1580965555 256)) (and (= (mod ~y$r_buff1_thd2~0_In-1580965555 256) 0) .cse1))) (= |P1Thread1of1ForFork2_#t~ite15_Out-1580965555| |P1Thread1of1ForFork2_#t~ite14_Out-1580965555|) (= ~y$w_buff0_used~0_In-1580965555 |P1Thread1of1ForFork2_#t~ite14_Out-1580965555|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1580965555, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1580965555, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1580965555, ~weak$$choice2~0=~weak$$choice2~0_In-1580965555, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-1580965555|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1580965555} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1580965555, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1580965555, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1580965555, ~weak$$choice2~0=~weak$$choice2~0_In-1580965555, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1580965555|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-1580965555|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1580965555} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 20:58:09,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L764: Formula: (and (= v_~y$r_buff0_thd2~0_49 v_~y$r_buff0_thd2~0_48) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_48, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 20:58:09,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L764-->L764-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In905116246 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In905116246 256)))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In905116246 256))) (= (mod ~y$w_buff0_used~0_In905116246 256) 0) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In905116246 256))))) .cse1 (= |P1Thread1of1ForFork2_#t~ite23_Out905116246| ~y$r_buff1_thd2~0_In905116246) (= |P1Thread1of1ForFork2_#t~ite24_Out905116246| |P1Thread1of1ForFork2_#t~ite23_Out905116246|)) (and (= |P1Thread1of1ForFork2_#t~ite24_Out905116246| ~y$r_buff1_thd2~0_In905116246) (= |P1Thread1of1ForFork2_#t~ite23_In905116246| |P1Thread1of1ForFork2_#t~ite23_Out905116246|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In905116246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In905116246, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In905116246, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In905116246|, ~weak$$choice2~0=~weak$$choice2~0_In905116246, ~y$w_buff1_used~0=~y$w_buff1_used~0_In905116246} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In905116246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In905116246, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In905116246, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out905116246|, ~weak$$choice2~0=~weak$$choice2~0_In905116246, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out905116246|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In905116246} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 20:58:09,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L766-->L774: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_19 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_19, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 20:58:09,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In560655379 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In560655379 256)))) (or (and (= ~y$w_buff0_used~0_In560655379 |P2Thread1of1ForFork3_#t~ite28_Out560655379|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork3_#t~ite28_Out560655379|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In560655379, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In560655379} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In560655379, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In560655379, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out560655379|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 20:58:09,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-537307077 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-537307077 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-537307077 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-537307077 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite29_Out-537307077| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite29_Out-537307077| ~y$w_buff1_used~0_In-537307077)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-537307077, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-537307077, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-537307077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-537307077} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-537307077, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-537307077, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-537307077, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-537307077|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-537307077} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 20:58:09,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L798-->L799: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In33340187 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In33340187 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out33340187 ~y$r_buff0_thd3~0_In33340187)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd3~0_Out33340187 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In33340187, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In33340187} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out33340187|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In33340187, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out33340187} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 20:58:09,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-914435735 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-914435735 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-914435735 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-914435735 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite31_Out-914435735| ~y$r_buff1_thd3~0_In-914435735) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork3_#t~ite31_Out-914435735| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-914435735, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-914435735, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-914435735, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-914435735} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-914435735, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-914435735, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-914435735, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-914435735|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-914435735} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 20:58:09,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L799-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= |v_P2Thread1of1ForFork3_#t~ite31_8| v_~y$r_buff1_thd3~0_12) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_12, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 20:58:09,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L853: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:58:09,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L853-2-->L853-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1146345556 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1146345556 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite42_Out1146345556| |ULTIMATE.start_main_#t~ite43_Out1146345556|))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite42_Out1146345556| ~y~0_In1146345556)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out1146345556| ~y$w_buff1~0_In1146345556) (not .cse0) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1146345556, ~y~0=~y~0_In1146345556, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1146345556, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1146345556} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1146345556, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1146345556|, ~y~0=~y~0_In1146345556, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1146345556|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1146345556, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1146345556} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:58:09,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L854-->L854-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1695487575 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1695487575 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1695487575| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1695487575| ~y$w_buff0_used~0_In-1695487575)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1695487575, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1695487575} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1695487575, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1695487575, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1695487575|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:58:09,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1672737811 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1672737811 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1672737811 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1672737811 256) 0))) (or (and (= ~y$w_buff1_used~0_In1672737811 |ULTIMATE.start_main_#t~ite45_Out1672737811|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out1672737811|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1672737811, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1672737811, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1672737811, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1672737811} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1672737811, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1672737811, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1672737811, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1672737811|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1672737811} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:58:09,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1673842751 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1673842751 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1673842751 |ULTIMATE.start_main_#t~ite46_Out1673842751|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite46_Out1673842751| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1673842751, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1673842751} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1673842751, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1673842751, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1673842751|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 20:58:09,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L857-->L857-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1716436397 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1716436397 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1716436397 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1716436397 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out1716436397| ~y$r_buff1_thd0~0_In1716436397) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite47_Out1716436397| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1716436397, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1716436397, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1716436397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1716436397} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1716436397, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1716436397, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1716436397|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1716436397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1716436397} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 20:58:09,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_10 2) (= |v_ULTIMATE.start_main_#t~ite47_9| v_~y$r_buff1_thd0~0_15) (= 2 v_~__unbuffered_p3_EAX~0_8) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_14 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_~main$tmp_guard1~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_8) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|, ~z~0=v_~z~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:58:09,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:58:09 BasicIcfg [2019-12-18 20:58:09,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:58:09,753 INFO L168 Benchmark]: Toolchain (without parser) took 161326.71 ms. Allocated memory was 145.2 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.7 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 20:58:09,753 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 20:58:09,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 861.64 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.5 MB in the beginning and 155.7 MB in the end (delta: -55.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:58:09,757 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.31 ms. Allocated memory is still 202.9 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:58:09,758 INFO L168 Benchmark]: Boogie Preprocessor took 38.14 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:58:09,759 INFO L168 Benchmark]: RCFGBuilder took 833.56 ms. Allocated memory is still 202.9 MB. Free memory was 151.1 MB in the beginning and 101.6 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-18 20:58:09,759 INFO L168 Benchmark]: TraceAbstraction took 159514.44 ms. Allocated memory was 202.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.9 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 20:58:09,764 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 861.64 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.5 MB in the beginning and 155.7 MB in the end (delta: -55.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.31 ms. Allocated memory is still 202.9 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.14 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 833.56 ms. Allocated memory is still 202.9 MB. Free memory was 151.1 MB in the beginning and 101.6 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 159514.44 ms. Allocated memory was 202.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.9 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 180 ProgramPointsBefore, 92 ProgramPointsAfterwards, 208 TransitionsBefore, 99 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 7362 VarBasedMoverChecksPositive, 181 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 78681 CheckedPairsTotal, 120 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(&t725, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] FCALL, FORK 0 pthread_create(&t726, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t727, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L847] FCALL, FORK 0 pthread_create(&t728, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 4 z = 2 [L812] 4 __unbuffered_p3_EAX = z [L815] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L751] 2 x = 2 [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L795] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L853] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 159.0s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 28.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3877 SDtfs, 3818 SDslu, 8586 SDs, 0 SdLazy, 3689 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 31 SyntacticMatches, 11 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241474occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 78.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 143334 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 917 NumberOfCodeBlocks, 917 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 837 ConstructedInterpolants, 0 QuantifiedInterpolants, 129015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...