/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi008_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:19:35,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:19:35,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:19:35,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:19:35,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:19:35,282 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:19:35,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:19:35,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:19:35,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:19:35,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:19:35,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:19:35,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:19:35,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:19:35,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:19:35,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:19:35,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:19:35,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:19:35,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:19:35,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:19:35,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:19:35,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:19:35,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:19:35,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:19:35,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:19:35,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:19:35,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:19:35,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:19:35,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:19:35,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:19:35,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:19:35,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:19:35,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:19:35,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:19:35,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:19:35,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:19:35,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:19:35,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:19:35,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:19:35,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:19:35,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:19:35,338 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:19:35,339 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:19:35,373 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:19:35,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:19:35,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:19:35,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:19:35,375 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:19:35,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:19:35,375 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:19:35,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:19:35,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:19:35,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:19:35,376 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:19:35,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:19:35,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:19:35,376 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:19:35,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:19:35,378 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:19:35,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:19:35,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:19:35,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:19:35,379 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:19:35,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:19:35,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:19:35,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:19:35,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:19:35,380 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:19:35,380 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:19:35,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:19:35,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:19:35,381 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:19:35,381 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:19:35,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:19:35,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:19:35,679 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:19:35,680 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:19:35,681 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:19:35,682 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008_pso.opt.i [2019-12-26 23:19:35,741 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c835665/e34837b6ced645958db69a82163f2694/FLAG701b378bd [2019-12-26 23:19:36,276 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:19:36,277 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008_pso.opt.i [2019-12-26 23:19:36,298 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c835665/e34837b6ced645958db69a82163f2694/FLAG701b378bd [2019-12-26 23:19:36,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c835665/e34837b6ced645958db69a82163f2694 [2019-12-26 23:19:36,568 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:19:36,570 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:19:36,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:19:36,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:19:36,578 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:19:36,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:19:36" (1/1) ... [2019-12-26 23:19:36,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74df8f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:19:36, skipping insertion in model container [2019-12-26 23:19:36,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:19:36" (1/1) ... [2019-12-26 23:19:36,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:19:36,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:19:37,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:19:37,219 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:19:37,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:19:37,351 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:19:37,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:19:37 WrapperNode [2019-12-26 23:19:37,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:19:37,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:19:37,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:19:37,353 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:19:37,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:19:37" (1/1) ... [2019-12-26 23:19:37,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:19:37" (1/1) ... [2019-12-26 23:19:37,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:19:37,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:19:37,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:19:37,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:19:37,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:19:37" (1/1) ... [2019-12-26 23:19:37,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:19:37" (1/1) ... [2019-12-26 23:19:37,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:19:37" (1/1) ... [2019-12-26 23:19:37,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:19:37" (1/1) ... [2019-12-26 23:19:37,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:19:37" (1/1) ... [2019-12-26 23:19:37,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:19:37" (1/1) ... [2019-12-26 23:19:37,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:19:37" (1/1) ... [2019-12-26 23:19:37,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:19:37,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:19:37,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:19:37,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:19:37,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:19:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:19:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:19:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:19:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:19:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:19:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:19:37,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:19:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:19:37,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:19:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:19:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:19:37,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:19:37,550 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:19:38,515 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:19:38,516 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:19:38,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:19:38 BoogieIcfgContainer [2019-12-26 23:19:38,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:19:38,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:19:38,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:19:38,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:19:38,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:19:36" (1/3) ... [2019-12-26 23:19:38,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1b5e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:19:38, skipping insertion in model container [2019-12-26 23:19:38,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:19:37" (2/3) ... [2019-12-26 23:19:38,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1b5e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:19:38, skipping insertion in model container [2019-12-26 23:19:38,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:19:38" (3/3) ... [2019-12-26 23:19:38,529 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_pso.opt.i [2019-12-26 23:19:38,540 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:19:38,540 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:19:38,554 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:19:38,555 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:19:38,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,620 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,621 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,662 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,663 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,663 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,665 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,665 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,717 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,719 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,739 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,741 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,743 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:19:38,763 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:19:38,791 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:19:38,792 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:19:38,792 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:19:38,792 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:19:38,792 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:19:38,792 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:19:38,792 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:19:38,793 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:19:38,813 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-26 23:19:38,815 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-26 23:19:38,984 INFO L132 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-26 23:19:38,984 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:19:39,005 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-26 23:19:39,036 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-26 23:19:39,131 INFO L132 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-26 23:19:39,132 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:19:39,144 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-26 23:19:39,170 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-26 23:19:39,171 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:19:44,416 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-26 23:19:44,556 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-26 23:19:44,641 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125257 [2019-12-26 23:19:44,641 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-26 23:19:44,645 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 129 transitions [2019-12-26 23:19:46,035 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25272 states. [2019-12-26 23:19:46,037 INFO L276 IsEmpty]: Start isEmpty. Operand 25272 states. [2019-12-26 23:19:46,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:19:46,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:46,044 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:19:46,044 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:46,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:46,049 INFO L82 PathProgramCache]: Analyzing trace with hash 961433507, now seen corresponding path program 1 times [2019-12-26 23:19:46,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:46,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067158714] [2019-12-26 23:19:46,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:46,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067158714] [2019-12-26 23:19:46,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:46,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:19:46,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277825809] [2019-12-26 23:19:46,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:19:46,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:46,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:19:46,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:19:46,298 INFO L87 Difference]: Start difference. First operand 25272 states. Second operand 3 states. [2019-12-26 23:19:46,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:46,996 INFO L93 Difference]: Finished difference Result 25080 states and 89817 transitions. [2019-12-26 23:19:46,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:19:46,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:19:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:47,227 INFO L225 Difference]: With dead ends: 25080 [2019-12-26 23:19:47,227 INFO L226 Difference]: Without dead ends: 23470 [2019-12-26 23:19:47,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:19:47,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23470 states. [2019-12-26 23:19:49,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23470 to 23470. [2019-12-26 23:19:49,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23470 states. [2019-12-26 23:19:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23470 states to 23470 states and 83991 transitions. [2019-12-26 23:19:49,208 INFO L78 Accepts]: Start accepts. Automaton has 23470 states and 83991 transitions. Word has length 5 [2019-12-26 23:19:49,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:49,208 INFO L462 AbstractCegarLoop]: Abstraction has 23470 states and 83991 transitions. [2019-12-26 23:19:49,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:19:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand 23470 states and 83991 transitions. [2019-12-26 23:19:49,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:19:49,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:49,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:19:49,220 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:49,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:49,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1303916439, now seen corresponding path program 1 times [2019-12-26 23:19:49,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:49,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076308696] [2019-12-26 23:19:49,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:49,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:49,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076308696] [2019-12-26 23:19:49,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:49,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:19:49,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154737817] [2019-12-26 23:19:49,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:19:49,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:49,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:19:49,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:19:49,379 INFO L87 Difference]: Start difference. First operand 23470 states and 83991 transitions. Second operand 4 states. [2019-12-26 23:19:49,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:49,493 INFO L93 Difference]: Finished difference Result 4442 states and 12820 transitions. [2019-12-26 23:19:49,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:19:49,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:19:49,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:49,502 INFO L225 Difference]: With dead ends: 4442 [2019-12-26 23:19:49,503 INFO L226 Difference]: Without dead ends: 2832 [2019-12-26 23:19:49,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:19:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2019-12-26 23:19:49,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2832. [2019-12-26 23:19:49,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2832 states. [2019-12-26 23:19:49,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2832 states to 2832 states and 7079 transitions. [2019-12-26 23:19:49,820 INFO L78 Accepts]: Start accepts. Automaton has 2832 states and 7079 transitions. Word has length 11 [2019-12-26 23:19:49,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:49,820 INFO L462 AbstractCegarLoop]: Abstraction has 2832 states and 7079 transitions. [2019-12-26 23:19:49,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:19:49,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 7079 transitions. [2019-12-26 23:19:49,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:19:49,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:49,822 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:19:49,822 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:49,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:49,823 INFO L82 PathProgramCache]: Analyzing trace with hash -273660052, now seen corresponding path program 1 times [2019-12-26 23:19:49,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:49,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160896530] [2019-12-26 23:19:49,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:49,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160896530] [2019-12-26 23:19:49,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:49,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:19:49,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962067682] [2019-12-26 23:19:49,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:19:49,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:49,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:19:49,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:19:49,885 INFO L87 Difference]: Start difference. First operand 2832 states and 7079 transitions. Second operand 4 states. [2019-12-26 23:19:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:50,172 INFO L93 Difference]: Finished difference Result 4003 states and 9706 transitions. [2019-12-26 23:19:50,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:19:50,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:19:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:50,183 INFO L225 Difference]: With dead ends: 4003 [2019-12-26 23:19:50,183 INFO L226 Difference]: Without dead ends: 3988 [2019-12-26 23:19:50,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:19:50,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3988 states. [2019-12-26 23:19:50,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3988 to 3892. [2019-12-26 23:19:50,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3892 states. [2019-12-26 23:19:50,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 9498 transitions. [2019-12-26 23:19:50,304 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 9498 transitions. Word has length 14 [2019-12-26 23:19:50,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:50,306 INFO L462 AbstractCegarLoop]: Abstraction has 3892 states and 9498 transitions. [2019-12-26 23:19:50,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:19:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 9498 transitions. [2019-12-26 23:19:50,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 23:19:50,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:50,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:19:50,308 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:50,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:50,308 INFO L82 PathProgramCache]: Analyzing trace with hash 106501689, now seen corresponding path program 1 times [2019-12-26 23:19:50,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:50,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184808832] [2019-12-26 23:19:50,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:50,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-26 23:19:50,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184808832] [2019-12-26 23:19:50,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:50,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:19:50,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513238790] [2019-12-26 23:19:50,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:19:50,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:50,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:19:50,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:19:50,389 INFO L87 Difference]: Start difference. First operand 3892 states and 9498 transitions. Second operand 3 states. [2019-12-26 23:19:50,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:50,482 INFO L93 Difference]: Finished difference Result 6646 states and 15406 transitions. [2019-12-26 23:19:50,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:19:50,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 23:19:50,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:50,498 INFO L225 Difference]: With dead ends: 6646 [2019-12-26 23:19:50,499 INFO L226 Difference]: Without dead ends: 6642 [2019-12-26 23:19:50,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:19:50,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6642 states. [2019-12-26 23:19:50,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6642 to 5931. [2019-12-26 23:19:50,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5931 states. [2019-12-26 23:19:50,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5931 states to 5931 states and 13936 transitions. [2019-12-26 23:19:50,635 INFO L78 Accepts]: Start accepts. Automaton has 5931 states and 13936 transitions. Word has length 15 [2019-12-26 23:19:50,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:50,635 INFO L462 AbstractCegarLoop]: Abstraction has 5931 states and 13936 transitions. [2019-12-26 23:19:50,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:19:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 5931 states and 13936 transitions. [2019-12-26 23:19:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 23:19:50,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:50,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:19:50,638 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:50,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:50,638 INFO L82 PathProgramCache]: Analyzing trace with hash -717781961, now seen corresponding path program 1 times [2019-12-26 23:19:50,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:50,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565638977] [2019-12-26 23:19:50,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:50,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565638977] [2019-12-26 23:19:50,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:50,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:19:50,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634150353] [2019-12-26 23:19:50,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:19:50,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:50,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:19:50,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:19:50,724 INFO L87 Difference]: Start difference. First operand 5931 states and 13936 transitions. Second operand 4 states. [2019-12-26 23:19:50,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:50,994 INFO L93 Difference]: Finished difference Result 7446 states and 17184 transitions. [2019-12-26 23:19:50,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:19:50,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-26 23:19:50,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:51,014 INFO L225 Difference]: With dead ends: 7446 [2019-12-26 23:19:51,014 INFO L226 Difference]: Without dead ends: 7418 [2019-12-26 23:19:51,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:19:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7418 states. [2019-12-26 23:19:51,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7418 to 5909. [2019-12-26 23:19:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5909 states. [2019-12-26 23:19:51,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5909 states to 5909 states and 13876 transitions. [2019-12-26 23:19:51,135 INFO L78 Accepts]: Start accepts. Automaton has 5909 states and 13876 transitions. Word has length 17 [2019-12-26 23:19:51,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:51,135 INFO L462 AbstractCegarLoop]: Abstraction has 5909 states and 13876 transitions. [2019-12-26 23:19:51,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:19:51,136 INFO L276 IsEmpty]: Start isEmpty. Operand 5909 states and 13876 transitions. [2019-12-26 23:19:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:19:51,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:51,141 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-26 23:19:51,142 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:51,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2019815131, now seen corresponding path program 1 times [2019-12-26 23:19:51,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:51,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743844433] [2019-12-26 23:19:51,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:51,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743844433] [2019-12-26 23:19:51,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:51,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:19:51,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961842684] [2019-12-26 23:19:51,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:19:51,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:51,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:19:51,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:19:51,382 INFO L87 Difference]: Start difference. First operand 5909 states and 13876 transitions. Second operand 5 states. [2019-12-26 23:19:51,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:51,770 INFO L93 Difference]: Finished difference Result 8033 states and 18356 transitions. [2019-12-26 23:19:51,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:19:51,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 23:19:51,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:51,800 INFO L225 Difference]: With dead ends: 8033 [2019-12-26 23:19:51,800 INFO L226 Difference]: Without dead ends: 8032 [2019-12-26 23:19:51,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:19:51,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8032 states. [2019-12-26 23:19:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8032 to 7392. [2019-12-26 23:19:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7392 states. [2019-12-26 23:19:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7392 states to 7392 states and 17086 transitions. [2019-12-26 23:19:51,938 INFO L78 Accepts]: Start accepts. Automaton has 7392 states and 17086 transitions. Word has length 28 [2019-12-26 23:19:51,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:51,938 INFO L462 AbstractCegarLoop]: Abstraction has 7392 states and 17086 transitions. [2019-12-26 23:19:51,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:19:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 7392 states and 17086 transitions. [2019-12-26 23:19:51,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-26 23:19:51,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:51,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:19:51,947 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:51,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:51,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1401908326, now seen corresponding path program 1 times [2019-12-26 23:19:51,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:51,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630463902] [2019-12-26 23:19:51,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:51,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630463902] [2019-12-26 23:19:51,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:51,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:19:51,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239335182] [2019-12-26 23:19:51,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:19:51,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:51,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:19:51,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:19:51,990 INFO L87 Difference]: Start difference. First operand 7392 states and 17086 transitions. Second operand 3 states. [2019-12-26 23:19:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:52,070 INFO L93 Difference]: Finished difference Result 7931 states and 17358 transitions. [2019-12-26 23:19:52,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:19:52,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-26 23:19:52,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:52,087 INFO L225 Difference]: With dead ends: 7931 [2019-12-26 23:19:52,088 INFO L226 Difference]: Without dead ends: 7931 [2019-12-26 23:19:52,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:19:52,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7931 states. [2019-12-26 23:19:52,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7931 to 7375. [2019-12-26 23:19:52,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7375 states. [2019-12-26 23:19:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7375 states to 7375 states and 16200 transitions. [2019-12-26 23:19:52,233 INFO L78 Accepts]: Start accepts. Automaton has 7375 states and 16200 transitions. Word has length 31 [2019-12-26 23:19:52,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:52,234 INFO L462 AbstractCegarLoop]: Abstraction has 7375 states and 16200 transitions. [2019-12-26 23:19:52,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:19:52,234 INFO L276 IsEmpty]: Start isEmpty. Operand 7375 states and 16200 transitions. [2019-12-26 23:19:52,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 23:19:52,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:52,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:19:52,244 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:52,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:52,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1511424135, now seen corresponding path program 1 times [2019-12-26 23:19:52,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:52,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020856464] [2019-12-26 23:19:52,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:52,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-26 23:19:52,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020856464] [2019-12-26 23:19:52,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:52,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:19:52,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701274887] [2019-12-26 23:19:52,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:19:52,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:52,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:19:52,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:19:52,323 INFO L87 Difference]: Start difference. First operand 7375 states and 16200 transitions. Second operand 3 states. [2019-12-26 23:19:52,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:52,351 INFO L93 Difference]: Finished difference Result 7269 states and 15972 transitions. [2019-12-26 23:19:52,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:19:52,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-26 23:19:52,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:52,360 INFO L225 Difference]: With dead ends: 7269 [2019-12-26 23:19:52,360 INFO L226 Difference]: Without dead ends: 7269 [2019-12-26 23:19:52,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:19:52,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7269 states. [2019-12-26 23:19:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7269 to 7269. [2019-12-26 23:19:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7269 states. [2019-12-26 23:19:52,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7269 states to 7269 states and 15972 transitions. [2019-12-26 23:19:52,477 INFO L78 Accepts]: Start accepts. Automaton has 7269 states and 15972 transitions. Word has length 33 [2019-12-26 23:19:52,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:52,478 INFO L462 AbstractCegarLoop]: Abstraction has 7269 states and 15972 transitions. [2019-12-26 23:19:52,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:19:52,478 INFO L276 IsEmpty]: Start isEmpty. Operand 7269 states and 15972 transitions. [2019-12-26 23:19:52,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 23:19:52,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:52,488 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] [2019-12-26 23:19:52,488 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:52,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:52,489 INFO L82 PathProgramCache]: Analyzing trace with hash 532882183, now seen corresponding path program 1 times [2019-12-26 23:19:52,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:52,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231706437] [2019-12-26 23:19:52,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:52,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231706437] [2019-12-26 23:19:52,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:52,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:19:52,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102055448] [2019-12-26 23:19:52,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:19:52,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:52,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:19:52,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:19:52,567 INFO L87 Difference]: Start difference. First operand 7269 states and 15972 transitions. Second operand 5 states. [2019-12-26 23:19:53,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:53,387 INFO L93 Difference]: Finished difference Result 8162 states and 17672 transitions. [2019-12-26 23:19:53,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:19:53,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-26 23:19:53,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:53,397 INFO L225 Difference]: With dead ends: 8162 [2019-12-26 23:19:53,397 INFO L226 Difference]: Without dead ends: 8161 [2019-12-26 23:19:53,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:19:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8161 states. [2019-12-26 23:19:53,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8161 to 6422. [2019-12-26 23:19:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6422 states. [2019-12-26 23:19:53,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6422 states to 6422 states and 14260 transitions. [2019-12-26 23:19:53,509 INFO L78 Accepts]: Start accepts. Automaton has 6422 states and 14260 transitions. Word has length 34 [2019-12-26 23:19:53,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:53,509 INFO L462 AbstractCegarLoop]: Abstraction has 6422 states and 14260 transitions. [2019-12-26 23:19:53,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:19:53,510 INFO L276 IsEmpty]: Start isEmpty. Operand 6422 states and 14260 transitions. [2019-12-26 23:19:53,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:19:53,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:53,523 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] [2019-12-26 23:19:53,524 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:53,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1470290689, now seen corresponding path program 1 times [2019-12-26 23:19:53,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:53,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697284701] [2019-12-26 23:19:53,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19: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-26 23:19:53,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697284701] [2019-12-26 23:19:53,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:53,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:19:53,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471509459] [2019-12-26 23:19:53,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:19:53,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:53,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:19:53,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:19:53,627 INFO L87 Difference]: Start difference. First operand 6422 states and 14260 transitions. Second operand 5 states. [2019-12-26 23:19:53,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:53,746 INFO L93 Difference]: Finished difference Result 9446 states and 21083 transitions. [2019-12-26 23:19:53,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:19:53,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-26 23:19:53,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:53,756 INFO L225 Difference]: With dead ends: 9446 [2019-12-26 23:19:53,756 INFO L226 Difference]: Without dead ends: 7641 [2019-12-26 23:19:53,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:19:53,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7641 states. [2019-12-26 23:19:53,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7641 to 7641. [2019-12-26 23:19:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7641 states. [2019-12-26 23:19:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7641 states to 7641 states and 17066 transitions. [2019-12-26 23:19:53,891 INFO L78 Accepts]: Start accepts. Automaton has 7641 states and 17066 transitions. Word has length 41 [2019-12-26 23:19:53,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:53,891 INFO L462 AbstractCegarLoop]: Abstraction has 7641 states and 17066 transitions. [2019-12-26 23:19:53,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:19:53,892 INFO L276 IsEmpty]: Start isEmpty. Operand 7641 states and 17066 transitions. [2019-12-26 23:19:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 23:19:53,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:53,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:19:53,910 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:53,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:53,910 INFO L82 PathProgramCache]: Analyzing trace with hash 319193206, now seen corresponding path program 1 times [2019-12-26 23:19:53,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:53,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261369192] [2019-12-26 23:19:53,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:53,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261369192] [2019-12-26 23:19:53,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:53,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:19:53,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514886556] [2019-12-26 23:19:53,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:19:53,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:53,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:19:53,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:19:53,960 INFO L87 Difference]: Start difference. First operand 7641 states and 17066 transitions. Second operand 3 states. [2019-12-26 23:19:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:53,983 INFO L93 Difference]: Finished difference Result 7640 states and 17064 transitions. [2019-12-26 23:19:53,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:19:53,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-26 23:19:53,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:53,993 INFO L225 Difference]: With dead ends: 7640 [2019-12-26 23:19:53,993 INFO L226 Difference]: Without dead ends: 7640 [2019-12-26 23:19:53,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:19:54,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7640 states. [2019-12-26 23:19:54,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7640 to 7640. [2019-12-26 23:19:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7640 states. [2019-12-26 23:19:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7640 states to 7640 states and 17064 transitions. [2019-12-26 23:19:54,112 INFO L78 Accepts]: Start accepts. Automaton has 7640 states and 17064 transitions. Word has length 42 [2019-12-26 23:19:54,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:54,112 INFO L462 AbstractCegarLoop]: Abstraction has 7640 states and 17064 transitions. [2019-12-26 23:19:54,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:19:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 7640 states and 17064 transitions. [2019-12-26 23:19:54,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-26 23:19:54,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:54,127 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-26 23:19:54,128 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:54,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:54,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1536975682, now seen corresponding path program 1 times [2019-12-26 23:19:54,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:54,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705753192] [2019-12-26 23:19:54,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:54,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705753192] [2019-12-26 23:19:54,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:54,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:19:54,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328365332] [2019-12-26 23:19:54,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:19:54,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:54,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:19:54,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:19:54,197 INFO L87 Difference]: Start difference. First operand 7640 states and 17064 transitions. Second operand 4 states. [2019-12-26 23:19:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:54,234 INFO L93 Difference]: Finished difference Result 8654 states and 19274 transitions. [2019-12-26 23:19:54,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:19:54,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-12-26 23:19:54,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:54,242 INFO L225 Difference]: With dead ends: 8654 [2019-12-26 23:19:54,242 INFO L226 Difference]: Without dead ends: 6602 [2019-12-26 23:19:54,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:19:54,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6602 states. [2019-12-26 23:19:54,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6602 to 6582. [2019-12-26 23:19:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6582 states. [2019-12-26 23:19:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6582 states to 6582 states and 14669 transitions. [2019-12-26 23:19:54,349 INFO L78 Accepts]: Start accepts. Automaton has 6582 states and 14669 transitions. Word has length 43 [2019-12-26 23:19:54,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:54,350 INFO L462 AbstractCegarLoop]: Abstraction has 6582 states and 14669 transitions. [2019-12-26 23:19:54,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:19:54,350 INFO L276 IsEmpty]: Start isEmpty. Operand 6582 states and 14669 transitions. [2019-12-26 23:19:54,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-26 23:19:54,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:54,362 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-26 23:19:54,362 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:54,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:54,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1080490012, now seen corresponding path program 2 times [2019-12-26 23:19:54,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:54,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190669519] [2019-12-26 23:19:54,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:54,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190669519] [2019-12-26 23:19:54,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:54,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:19:54,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691975420] [2019-12-26 23:19:54,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:19:54,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:54,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:19:54,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:19:54,432 INFO L87 Difference]: Start difference. First operand 6582 states and 14669 transitions. Second operand 5 states. [2019-12-26 23:19:54,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:54,961 INFO L93 Difference]: Finished difference Result 7300 states and 16119 transitions. [2019-12-26 23:19:54,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:19:54,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-26 23:19:54,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:54,970 INFO L225 Difference]: With dead ends: 7300 [2019-12-26 23:19:54,970 INFO L226 Difference]: Without dead ends: 7300 [2019-12-26 23:19:54,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:19:54,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7300 states. [2019-12-26 23:19:55,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7300 to 7096. [2019-12-26 23:19:55,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7096 states. [2019-12-26 23:19:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7096 states to 7096 states and 15730 transitions. [2019-12-26 23:19:55,077 INFO L78 Accepts]: Start accepts. Automaton has 7096 states and 15730 transitions. Word has length 43 [2019-12-26 23:19:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:55,078 INFO L462 AbstractCegarLoop]: Abstraction has 7096 states and 15730 transitions. [2019-12-26 23:19:55,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:19:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 7096 states and 15730 transitions. [2019-12-26 23:19:55,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-26 23:19:55,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:55,092 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] [2019-12-26 23:19:55,092 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:55,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:55,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1389551641, now seen corresponding path program 1 times [2019-12-26 23:19:55,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:55,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984490471] [2019-12-26 23:19:55,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:55,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984490471] [2019-12-26 23:19:55,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:55,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:19:55,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847721654] [2019-12-26 23:19:55,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:19:55,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:55,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:19:55,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:19:55,167 INFO L87 Difference]: Start difference. First operand 7096 states and 15730 transitions. Second operand 5 states. [2019-12-26 23:19:55,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:55,219 INFO L93 Difference]: Finished difference Result 5082 states and 11182 transitions. [2019-12-26 23:19:55,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:19:55,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-26 23:19:55,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:55,221 INFO L225 Difference]: With dead ends: 5082 [2019-12-26 23:19:55,221 INFO L226 Difference]: Without dead ends: 878 [2019-12-26 23:19:55,222 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-26 23:19:55,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2019-12-26 23:19:55,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 836. [2019-12-26 23:19:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-12-26 23:19:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1673 transitions. [2019-12-26 23:19:55,232 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1673 transitions. Word has length 44 [2019-12-26 23:19:55,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:55,232 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1673 transitions. [2019-12-26 23:19:55,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:19:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1673 transitions. [2019-12-26 23:19:55,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 23:19:55,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:55,236 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-26 23:19:55,236 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:55,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:55,236 INFO L82 PathProgramCache]: Analyzing trace with hash 684089224, now seen corresponding path program 1 times [2019-12-26 23:19:55,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:55,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088239085] [2019-12-26 23:19:55,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:55,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088239085] [2019-12-26 23:19:55,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:55,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:19:55,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722326678] [2019-12-26 23:19:55,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:19:55,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:55,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:19:55,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:19:55,318 INFO L87 Difference]: Start difference. First operand 836 states and 1673 transitions. Second operand 8 states. [2019-12-26 23:19:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:55,564 INFO L93 Difference]: Finished difference Result 1533 states and 3044 transitions. [2019-12-26 23:19:55,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:19:55,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-26 23:19:55,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:55,566 INFO L225 Difference]: With dead ends: 1533 [2019-12-26 23:19:55,566 INFO L226 Difference]: Without dead ends: 1079 [2019-12-26 23:19:55,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:19:55,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-12-26 23:19:55,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 890. [2019-12-26 23:19:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-12-26 23:19:55,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1764 transitions. [2019-12-26 23:19:55,578 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1764 transitions. Word has length 59 [2019-12-26 23:19:55,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:55,578 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1764 transitions. [2019-12-26 23:19:55,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:19:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1764 transitions. [2019-12-26 23:19:55,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 23:19:55,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:55,580 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-26 23:19:55,581 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:55,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:55,581 INFO L82 PathProgramCache]: Analyzing trace with hash -810960120, now seen corresponding path program 2 times [2019-12-26 23:19:55,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:55,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899354317] [2019-12-26 23:19:55,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:55,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:55,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899354317] [2019-12-26 23:19:55,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:55,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:19:55,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534500893] [2019-12-26 23:19:55,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:19:55,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:55,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:19:55,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:19:55,683 INFO L87 Difference]: Start difference. First operand 890 states and 1764 transitions. Second operand 6 states. [2019-12-26 23:19:56,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:56,095 INFO L93 Difference]: Finished difference Result 1016 states and 1990 transitions. [2019-12-26 23:19:56,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:19:56,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-26 23:19:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:56,097 INFO L225 Difference]: With dead ends: 1016 [2019-12-26 23:19:56,097 INFO L226 Difference]: Without dead ends: 1016 [2019-12-26 23:19:56,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:19:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-12-26 23:19:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 920. [2019-12-26 23:19:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2019-12-26 23:19:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1819 transitions. [2019-12-26 23:19:56,109 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1819 transitions. Word has length 59 [2019-12-26 23:19:56,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:56,109 INFO L462 AbstractCegarLoop]: Abstraction has 920 states and 1819 transitions. [2019-12-26 23:19:56,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:19:56,109 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1819 transitions. [2019-12-26 23:19:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 23:19:56,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:56,111 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-26 23:19:56,112 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:56,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:56,112 INFO L82 PathProgramCache]: Analyzing trace with hash 208890408, now seen corresponding path program 3 times [2019-12-26 23:19:56,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:56,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102234227] [2019-12-26 23:19:56,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:19:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:19:56,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102234227] [2019-12-26 23:19:56,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:19:56,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:19:56,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751785345] [2019-12-26 23:19:56,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:19:56,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:19:56,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:19:56,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:19:56,230 INFO L87 Difference]: Start difference. First operand 920 states and 1819 transitions. Second operand 3 states. [2019-12-26 23:19:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:19:56,241 INFO L93 Difference]: Finished difference Result 919 states and 1817 transitions. [2019-12-26 23:19:56,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:19:56,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 23:19:56,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:19:56,243 INFO L225 Difference]: With dead ends: 919 [2019-12-26 23:19:56,243 INFO L226 Difference]: Without dead ends: 919 [2019-12-26 23:19:56,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:19:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-12-26 23:19:56,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 783. [2019-12-26 23:19:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-12-26 23:19:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1569 transitions. [2019-12-26 23:19:56,254 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1569 transitions. Word has length 59 [2019-12-26 23:19:56,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:19:56,254 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1569 transitions. [2019-12-26 23:19:56,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:19:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1569 transitions. [2019-12-26 23:19:56,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 23:19:56,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:19:56,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:19:56,256 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:19:56,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:19:56,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1155043701, now seen corresponding path program 1 times [2019-12-26 23:19:56,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:19:56,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659083374] [2019-12-26 23:19:56,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:19:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:19:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:19:56,373 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:19:56,374 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:19:56,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y~0_249 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1727~0.base_28| 4)) (= 0 v_~y$w_buff0~0_205) (= v_~y$w_buff0_used~0_843 0) (= v_~y$w_buff1_used~0_439 0) (= 0 v_~weak$$choice0~0_156) (= v_~main$tmp_guard1~0_42 0) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p0_EAX~0_77) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1727~0.base_28|) (= v_~__unbuffered_p0_EBX~0_51 0) (= v_~y$read_delayed~0_6 0) (= v_~weak$$choice2~0_238 0) (= v_~y$r_buff0_thd0~0_100 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd2~0_306) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1727~0.base_28|)) (= |v_ULTIMATE.start_main_~#t1727~0.offset_20| 0) (= v_~x~0_52 0) (= 0 v_~y$r_buff0_thd2~0_438) (= v_~y$r_buff1_thd1~0_261 0) (= 0 v_~__unbuffered_cnt~0_49) (= v_~__unbuffered_p1_EBX~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= v_~y$w_buff1~0_192 0) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1727~0.base_28| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1727~0.base_28| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1727~0.base_28|) |v_ULTIMATE.start_main_~#t1727~0.offset_20| 0)) |v_#memory_int_13|) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$flush_delayed~0_191 0) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff0_thd1~0_295 0) (= v_~y$r_buff1_thd0~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_843, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_14|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_~#t1727~0.offset=|v_ULTIMATE.start_main_~#t1727~0.offset_20|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_261, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_205, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_295, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_15|, ULTIMATE.start_main_~#t1728~0.base=|v_ULTIMATE.start_main_~#t1728~0.base_17|, ULTIMATE.start_main_~#t1728~0.offset=|v_ULTIMATE.start_main_~#t1728~0.offset_14|, ~y~0=v_~y~0_249, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_51, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_103|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_147|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_85|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_306, ~weak$$choice0~0=v_~weak$$choice0~0_156, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_115|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_29|, ~y$w_buff1~0=v_~y$w_buff1~0_192, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, #valid=|v_#valid_53|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_438, #memory_int=|v_#memory_int_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ULTIMATE.start_main_~#t1727~0.base=|v_ULTIMATE.start_main_~#t1727~0.base_28|, ~weak$$choice2~0=v_~weak$$choice2~0_238, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_204, ~x~0=v_~x~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1727~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1728~0.base, ULTIMATE.start_main_~#t1728~0.offset, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1727~0.base, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:19:56,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1728~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1728~0.base_13|) |v_ULTIMATE.start_main_~#t1728~0.offset_11| 1))) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1728~0.base_13|) 0) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1728~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1728~0.base_13|) (= |v_ULTIMATE.start_main_~#t1728~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1728~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1728~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1728~0.base=|v_ULTIMATE.start_main_~#t1728~0.base_13|, ULTIMATE.start_main_~#t1728~0.offset=|v_ULTIMATE.start_main_~#t1728~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1728~0.base, ULTIMATE.start_main_~#t1728~0.offset] because there is no mapped edge [2019-12-26 23:19:56,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] P1ENTRY-->L5-3: Formula: (and (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| 1) (= v_~y$w_buff0~0_39 v_~y$w_buff1~0_51) (= 1 v_~y$w_buff0~0_38) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_8) (= v_~y$w_buff0_used~0_162 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= (mod v_~y$w_buff1_used~0_84 256) 0) (= v_~y$w_buff1_used~0_84 v_~y$w_buff0_used~0_163) (= v_P1Thread1of1ForFork1_~arg.base_8 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_39, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_10, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff1~0=v_~y$w_buff1~0_51, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_8, ~y$w_buff0~0=v_~y$w_buff0~0_38, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:19:56,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L775-2-->L775-4: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In376469207 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In376469207 256)))) (or (and (= ~y$w_buff1~0_In376469207 |P1Thread1of1ForFork1_#t~ite28_Out376469207|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~y$w_buff0~0_In376469207 |P1Thread1of1ForFork1_#t~ite28_Out376469207|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In376469207, ~y$w_buff1~0=~y$w_buff1~0_In376469207, ~y$w_buff0~0=~y$w_buff0~0_In376469207, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In376469207} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In376469207, ~y$w_buff1~0=~y$w_buff1~0_In376469207, ~y$w_buff0~0=~y$w_buff0~0_In376469207, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In376469207, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out376469207|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-26 23:19:56,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L775-4-->L776: Formula: (= v_~y~0_77 |v_P1Thread1of1ForFork1_#t~ite28_10|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_10|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_13|, ~y~0=v_~y~0_77, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-26 23:19:56,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_11|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_11|, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-26 23:19:56,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-920196082 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-920196082 |P1Thread1of1ForFork1_#t~ite48_Out-920196082|)) (and .cse0 (= ~y~0_In-920196082 |P1Thread1of1ForFork1_#t~ite48_Out-920196082|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-920196082, ~y$flush_delayed~0=~y$flush_delayed~0_In-920196082, ~y~0=~y~0_In-920196082} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-920196082, ~y$flush_delayed~0=~y$flush_delayed~0_In-920196082, ~y~0=~y~0_In-920196082, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-920196082|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-26 23:19:56,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-627698540 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-627698540 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite51_Out-627698540| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite51_Out-627698540| ~y$w_buff0_used~0_In-627698540) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-627698540, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-627698540} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-627698540, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-627698540|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-627698540} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-26 23:19:56,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-626409108 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-626409108 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-626409108 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-626409108 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite52_Out-626409108| ~y$w_buff1_used~0_In-626409108)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite52_Out-626409108| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-626409108, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-626409108, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-626409108, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-626409108} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-626409108, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-626409108, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-626409108|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-626409108, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-626409108} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-26 23:19:56,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1183135877 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1183135877 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out-1183135877)) (and (= ~y$r_buff0_thd2~0_In-1183135877 ~y$r_buff0_thd2~0_Out-1183135877) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1183135877, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1183135877} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-1183135877|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1183135877, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1183135877} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:19:56,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L794-->L794-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1624318197 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1624318197 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1624318197 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1624318197 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In1624318197 |P1Thread1of1ForFork1_#t~ite54_Out1624318197|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite54_Out1624318197| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1624318197, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1624318197, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1624318197, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1624318197} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1624318197, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1624318197, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1624318197, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out1624318197|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1624318197} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-26 23:19:56,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_119 |v_P1Thread1of1ForFork1_#t~ite54_20|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_20|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_119, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_19|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:19:56,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1877208079 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out-1877208079| ~y$mem_tmp~0_In-1877208079) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite25_Out-1877208079| ~y~0_In-1877208079)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1877208079, ~y$flush_delayed~0=~y$flush_delayed~0_In-1877208079, ~y~0=~y~0_In-1877208079} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1877208079, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-1877208079|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1877208079, ~y~0=~y~0_In-1877208079} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-26 23:19:56,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L747-2-->P0EXIT: Formula: (and (= v_~y~0_124 |v_P0Thread1of1ForFork0_#t~ite25_20|) (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 0 v_~y$flush_delayed~0_78) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_19|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~y~0=v_~y~0_124} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-26 23:19:56,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= 0 (mod v_~y$w_buff0_used~0_212 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:19:56,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L821-2-->L821-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In969108845 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In969108845 256) 0))) (or (and (= ~y$w_buff1~0_In969108845 |ULTIMATE.start_main_#t~ite57_Out969108845|) (not .cse0) (not .cse1)) (and (= ~y~0_In969108845 |ULTIMATE.start_main_#t~ite57_Out969108845|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In969108845, ~y~0=~y~0_In969108845, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In969108845, ~y$w_buff1_used~0=~y$w_buff1_used~0_In969108845} OutVars{~y$w_buff1~0=~y$w_buff1~0_In969108845, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out969108845|, ~y~0=~y~0_In969108845, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In969108845, ~y$w_buff1_used~0=~y$w_buff1_used~0_In969108845} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-26 23:19:56,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-4-->L822: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite57_9|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_9|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_8|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-26 23:19:56,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1550161810 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1550161810 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-1550161810| 0)) (and (= |ULTIMATE.start_main_#t~ite59_Out-1550161810| ~y$w_buff0_used~0_In-1550161810) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1550161810, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1550161810} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1550161810, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1550161810, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1550161810|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-26 23:19:56,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1971869881 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1971869881 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1971869881 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1971869881 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite60_Out-1971869881| 0)) (and (= |ULTIMATE.start_main_#t~ite60_Out-1971869881| ~y$w_buff1_used~0_In-1971869881) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1971869881, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1971869881, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1971869881, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1971869881} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1971869881|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1971869881, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1971869881, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1971869881, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1971869881} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-26 23:19:56,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1503067272 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1503067272 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-1503067272| ~y$r_buff0_thd0~0_In-1503067272) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-1503067272| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1503067272, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1503067272} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1503067272|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1503067272, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1503067272} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-26 23:19:56,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1430715927 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1430715927 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1430715927 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1430715927 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-1430715927| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite62_Out-1430715927| ~y$r_buff1_thd0~0_In-1430715927) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1430715927, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1430715927, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1430715927, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1430715927} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1430715927|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1430715927, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1430715927, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1430715927, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1430715927} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-26 23:19:56,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= v_~__unbuffered_p1_EBX~0_25 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 1 v_~__unbuffered_p0_EAX~0_55) (= v_~y$r_buff1_thd0~0_175 |v_ULTIMATE.start_main_#t~ite62_45|) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p1_EAX~0_36)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_175, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:19:56,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:19:56 BasicIcfg [2019-12-26 23:19:56,569 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:19:56,573 INFO L168 Benchmark]: Toolchain (without parser) took 20000.81 ms. Allocated memory was 146.8 MB in the beginning and 839.9 MB in the end (delta: 693.1 MB). Free memory was 103.2 MB in the beginning and 236.8 MB in the end (delta: -133.6 MB). Peak memory consumption was 559.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:19:56,574 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 23:19:56,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.93 ms. Allocated memory was 146.8 MB in the beginning and 232.3 MB in the end (delta: 85.5 MB). Free memory was 102.8 MB in the beginning and 194.9 MB in the end (delta: -92.0 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:19:56,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.60 ms. Allocated memory is still 232.3 MB. Free memory was 194.9 MB in the beginning and 192.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:19:56,578 INFO L168 Benchmark]: Boogie Preprocessor took 51.11 ms. Allocated memory is still 232.3 MB. Free memory was 192.1 MB in the beginning and 189.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:19:56,579 INFO L168 Benchmark]: RCFGBuilder took 1047.98 ms. Allocated memory is still 232.3 MB. Free memory was 189.4 MB in the beginning and 135.6 MB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:19:56,583 INFO L168 Benchmark]: TraceAbstraction took 18048.70 ms. Allocated memory was 232.3 MB in the beginning and 839.9 MB in the end (delta: 607.6 MB). Free memory was 135.6 MB in the beginning and 236.8 MB in the end (delta: -101.2 MB). Peak memory consumption was 506.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:19:56,591 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 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 777.93 ms. Allocated memory was 146.8 MB in the beginning and 232.3 MB in the end (delta: 85.5 MB). Free memory was 102.8 MB in the beginning and 194.9 MB in the end (delta: -92.0 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.60 ms. Allocated memory is still 232.3 MB. Free memory was 194.9 MB in the beginning and 192.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.11 ms. Allocated memory is still 232.3 MB. Free memory was 192.1 MB in the beginning and 189.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1047.98 ms. Allocated memory is still 232.3 MB. Free memory was 189.4 MB in the beginning and 135.6 MB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18048.70 ms. Allocated memory was 232.3 MB in the beginning and 839.9 MB in the end (delta: 607.6 MB). Free memory was 135.6 MB in the beginning and 236.8 MB in the end (delta: -101.2 MB). Peak memory consumption was 506.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 179 ProgramPointsBefore, 105 ProgramPointsAfterwards, 228 TransitionsBefore, 129 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 28 ChoiceCompositions, 9059 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 68 SemBasedMoverChecksPositive, 299 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 125257 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1727, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L815] FCALL, FORK 0 pthread_create(&t1728, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 y$flush_delayed = weak$$choice2 [L774] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L775] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L776] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L776] 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)) [L777] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L777] 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)) [L778] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L778] 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)) [L779] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L779] 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)) [L781] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L781] 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)) [L782] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L783] 2 y = y$flush_delayed ? y$mem_tmp : y [L784] 2 y$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L729] 1 x = 1 [L732] 1 __unbuffered_p0_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L744] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L745] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 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 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3380 SDtfs, 2810 SDslu, 5346 SDs, 0 SdLazy, 2044 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25272occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 5938 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 638 NumberOfCodeBlocks, 638 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 561 ConstructedInterpolants, 0 QuantifiedInterpolants, 65351 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...