/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:11:38,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:11:38,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:11:38,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:11:38,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:11:38,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:11:38,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:11:38,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:11:38,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:11:38,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:11:38,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:11:38,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:11:38,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:11:38,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:11:38,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:11:38,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:11:38,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:11:38,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:11:38,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:11:38,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:11:38,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:11:38,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:11:38,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:11:38,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:11:38,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:11:38,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:11:38,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:11:38,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:11:38,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:11:38,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:11:38,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:11:38,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:11:38,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:11:38,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:11:38,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:11:38,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:11:38,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:11:38,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:11:38,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:11:38,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:11:38,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:11:38,429 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:11:38,462 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:11:38,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:11:38,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:11:38,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:11:38,467 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:11:38,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:11:38,467 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:11:38,467 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:11:38,467 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:11:38,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:11:38,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:11:38,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:11:38,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:11:38,470 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:11:38,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:11:38,471 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:11:38,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:11:38,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:11:38,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:11:38,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:11:38,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:11:38,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:11:38,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:11:38,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:11:38,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:11:38,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:11:38,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:11:38,475 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:11:38,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:11:38,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:11:38,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:11:38,758 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:11:38,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:11:38,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:11:38,765 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:11:38,766 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.opt.i [2019-12-18 21:11:38,829 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dc8c3cff/64c6553d99d6404393c7aa6d99dae569/FLAG9119ec50c [2019-12-18 21:11:39,400 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:11:39,402 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_rmo.opt.i [2019-12-18 21:11:39,429 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dc8c3cff/64c6553d99d6404393c7aa6d99dae569/FLAG9119ec50c [2019-12-18 21:11:39,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dc8c3cff/64c6553d99d6404393c7aa6d99dae569 [2019-12-18 21:11:39,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:11:39,670 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:11:39,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:11:39,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:11:39,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:11:39,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:11:39" (1/1) ... [2019-12-18 21:11:39,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:39, skipping insertion in model container [2019-12-18 21:11:39,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:11:39" (1/1) ... [2019-12-18 21:11:39,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:11:39,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:11:40,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:11:40,246 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:11:40,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:11:40,405 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:11:40,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:40 WrapperNode [2019-12-18 21:11:40,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:11:40,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:11:40,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:11:40,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:11:40,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:40" (1/1) ... [2019-12-18 21:11:40,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:40" (1/1) ... [2019-12-18 21:11:40,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:11:40,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:11:40,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:11:40,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:11:40,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:40" (1/1) ... [2019-12-18 21:11:40,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:40" (1/1) ... [2019-12-18 21:11:40,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:40" (1/1) ... [2019-12-18 21:11:40,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:40" (1/1) ... [2019-12-18 21:11:40,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:40" (1/1) ... [2019-12-18 21:11:40,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:40" (1/1) ... [2019-12-18 21:11:40,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:40" (1/1) ... [2019-12-18 21:11:40,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:11:40,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:11:40,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:11:40,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:11:40,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:11:40,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:11:40,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:11:40,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:11:40,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:11:40,595 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:11:40,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:11:40,596 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:11:40,597 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:11:40,597 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:11:40,598 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:11:40,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:11:40,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:11:40,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:11:40,601 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:11:41,295 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:11:41,296 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:11:41,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:11:41 BoogieIcfgContainer [2019-12-18 21:11:41,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:11:41,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:11:41,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:11:41,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:11:41,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:11:39" (1/3) ... [2019-12-18 21:11:41,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d6983a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:11:41, skipping insertion in model container [2019-12-18 21:11:41,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:40" (2/3) ... [2019-12-18 21:11:41,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d6983a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:11:41, skipping insertion in model container [2019-12-18 21:11:41,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:11:41" (3/3) ... [2019-12-18 21:11:41,307 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_rmo.opt.i [2019-12-18 21:11:41,319 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:11:41,319 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:11:41,331 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:11:41,332 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:11:41,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,397 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,398 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,441 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,441 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,441 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,442 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,442 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,449 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,449 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,458 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,460 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,467 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,468 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,468 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,475 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,475 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:41,491 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:11:41,509 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:11:41,509 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:11:41,509 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:11:41,509 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:11:41,510 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:11:41,510 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:11:41,510 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:11:41,510 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:11:41,525 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-18 21:11:41,528 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 21:11:41,612 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 21:11:41,612 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:11:41,629 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:11:41,654 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 21:11:41,704 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 21:11:41,704 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:11:41,714 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:11:41,734 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 21:11:41,735 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:11:45,165 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 21:11:45,319 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 21:11:45,485 INFO L206 etLargeBlockEncoding]: Checked pairs total: 71962 [2019-12-18 21:11:45,485 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 21:11:45,489 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 96 transitions [2019-12-18 21:12:01,328 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 101822 states. [2019-12-18 21:12:01,331 INFO L276 IsEmpty]: Start isEmpty. Operand 101822 states. [2019-12-18 21:12:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 21:12:01,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:01,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 21:12:01,339 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:01,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:01,348 INFO L82 PathProgramCache]: Analyzing trace with hash 797474839, now seen corresponding path program 1 times [2019-12-18 21:12:01,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:01,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450812136] [2019-12-18 21:12:01,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:01,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450812136] [2019-12-18 21:12:01,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:01,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:12:01,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255911271] [2019-12-18 21:12:01,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:12:01,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:01,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:12:01,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:01,592 INFO L87 Difference]: Start difference. First operand 101822 states. Second operand 3 states. [2019-12-18 21:12:05,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:05,045 INFO L93 Difference]: Finished difference Result 99897 states and 434561 transitions. [2019-12-18 21:12:05,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:12:05,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 21:12:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:05,724 INFO L225 Difference]: With dead ends: 99897 [2019-12-18 21:12:05,724 INFO L226 Difference]: Without dead ends: 94017 [2019-12-18 21:12:05,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:09,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94017 states. [2019-12-18 21:12:11,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94017 to 94017. [2019-12-18 21:12:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94017 states. [2019-12-18 21:12:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94017 states to 94017 states and 408465 transitions. [2019-12-18 21:12:15,509 INFO L78 Accepts]: Start accepts. Automaton has 94017 states and 408465 transitions. Word has length 5 [2019-12-18 21:12:15,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:15,510 INFO L462 AbstractCegarLoop]: Abstraction has 94017 states and 408465 transitions. [2019-12-18 21:12:15,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:12:15,510 INFO L276 IsEmpty]: Start isEmpty. Operand 94017 states and 408465 transitions. [2019-12-18 21:12:15,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:12:15,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:15,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:15,518 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:15,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:15,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1757025115, now seen corresponding path program 1 times [2019-12-18 21:12:15,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:15,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549821650] [2019-12-18 21:12:15,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:15,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:15,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549821650] [2019-12-18 21:12:15,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:15,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:12:15,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306642460] [2019-12-18 21:12:15,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:12:15,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:15,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:12:15,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:15,618 INFO L87 Difference]: Start difference. First operand 94017 states and 408465 transitions. Second operand 3 states. [2019-12-18 21:12:15,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:15,927 INFO L93 Difference]: Finished difference Result 23899 states and 83357 transitions. [2019-12-18 21:12:15,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:12:15,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:12:15,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:16,027 INFO L225 Difference]: With dead ends: 23899 [2019-12-18 21:12:16,027 INFO L226 Difference]: Without dead ends: 23899 [2019-12-18 21:12:16,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:16,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23899 states. [2019-12-18 21:12:16,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23899 to 23899. [2019-12-18 21:12:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23899 states. [2019-12-18 21:12:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23899 states to 23899 states and 83357 transitions. [2019-12-18 21:12:17,511 INFO L78 Accepts]: Start accepts. Automaton has 23899 states and 83357 transitions. Word has length 13 [2019-12-18 21:12:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:17,512 INFO L462 AbstractCegarLoop]: Abstraction has 23899 states and 83357 transitions. [2019-12-18 21:12:17,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:12:17,512 INFO L276 IsEmpty]: Start isEmpty. Operand 23899 states and 83357 transitions. [2019-12-18 21:12:17,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:12:17,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:17,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:17,515 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:17,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:17,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1772800501, now seen corresponding path program 1 times [2019-12-18 21:12:17,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:17,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788895632] [2019-12-18 21:12:17,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:17,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:17,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788895632] [2019-12-18 21:12:17,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:17,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:12:17,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295064342] [2019-12-18 21:12:17,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:12:17,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:17,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:12:17,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:12:17,652 INFO L87 Difference]: Start difference. First operand 23899 states and 83357 transitions. Second operand 4 states. [2019-12-18 21:12:18,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:18,058 INFO L93 Difference]: Finished difference Result 35061 states and 117944 transitions. [2019-12-18 21:12:18,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:12:18,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 21:12:18,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:18,180 INFO L225 Difference]: With dead ends: 35061 [2019-12-18 21:12:18,180 INFO L226 Difference]: Without dead ends: 35047 [2019-12-18 21:12:18,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:12:18,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35047 states. [2019-12-18 21:12:19,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35047 to 31443. [2019-12-18 21:12:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31443 states. [2019-12-18 21:12:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31443 states to 31443 states and 107008 transitions. [2019-12-18 21:12:19,222 INFO L78 Accepts]: Start accepts. Automaton has 31443 states and 107008 transitions. Word has length 13 [2019-12-18 21:12:19,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:19,223 INFO L462 AbstractCegarLoop]: Abstraction has 31443 states and 107008 transitions. [2019-12-18 21:12:19,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:12:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 31443 states and 107008 transitions. [2019-12-18 21:12:19,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:12:19,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:19,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:19,227 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:19,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:19,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1424057850, now seen corresponding path program 1 times [2019-12-18 21:12:19,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:19,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900492573] [2019-12-18 21:12:19,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:19,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900492573] [2019-12-18 21:12:19,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:19,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:12:19,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984391237] [2019-12-18 21:12:19,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:12:19,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:19,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:12:19,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:12:19,313 INFO L87 Difference]: Start difference. First operand 31443 states and 107008 transitions. Second operand 5 states. [2019-12-18 21:12:20,779 WARN L192 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 6 [2019-12-18 21:12:21,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:21,257 INFO L93 Difference]: Finished difference Result 45557 states and 152262 transitions. [2019-12-18 21:12:21,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:12:21,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 21:12:21,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:21,384 INFO L225 Difference]: With dead ends: 45557 [2019-12-18 21:12:21,384 INFO L226 Difference]: Without dead ends: 45539 [2019-12-18 21:12:21,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:12:21,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45539 states. [2019-12-18 21:12:22,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45539 to 37201. [2019-12-18 21:12:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37201 states. [2019-12-18 21:12:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37201 states to 37201 states and 125618 transitions. [2019-12-18 21:12:22,446 INFO L78 Accepts]: Start accepts. Automaton has 37201 states and 125618 transitions. Word has length 14 [2019-12-18 21:12:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:22,448 INFO L462 AbstractCegarLoop]: Abstraction has 37201 states and 125618 transitions. [2019-12-18 21:12:22,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:12:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 37201 states and 125618 transitions. [2019-12-18 21:12:22,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:12:22,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:22,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:22,460 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:22,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:22,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1169616424, now seen corresponding path program 1 times [2019-12-18 21:12:22,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:22,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985971593] [2019-12-18 21:12:22,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:22,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985971593] [2019-12-18 21:12:22,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:22,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:12:22,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280354373] [2019-12-18 21:12:22,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:12:22,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:22,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:12:22,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:12:22,549 INFO L87 Difference]: Start difference. First operand 37201 states and 125618 transitions. Second operand 6 states. [2019-12-18 21:12:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:23,695 INFO L93 Difference]: Finished difference Result 55837 states and 184006 transitions. [2019-12-18 21:12:23,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:12:23,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 21:12:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:23,813 INFO L225 Difference]: With dead ends: 55837 [2019-12-18 21:12:23,814 INFO L226 Difference]: Without dead ends: 55807 [2019-12-18 21:12:23,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:12:24,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55807 states. [2019-12-18 21:12:24,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55807 to 37101. [2019-12-18 21:12:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37101 states. [2019-12-18 21:12:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37101 states to 37101 states and 124278 transitions. [2019-12-18 21:12:24,663 INFO L78 Accepts]: Start accepts. Automaton has 37101 states and 124278 transitions. Word has length 22 [2019-12-18 21:12:24,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:24,663 INFO L462 AbstractCegarLoop]: Abstraction has 37101 states and 124278 transitions. [2019-12-18 21:12:24,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:12:24,663 INFO L276 IsEmpty]: Start isEmpty. Operand 37101 states and 124278 transitions. [2019-12-18 21:12:24,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:12:24,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:24,680 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] [2019-12-18 21:12:24,680 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:24,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:24,681 INFO L82 PathProgramCache]: Analyzing trace with hash 189468664, now seen corresponding path program 1 times [2019-12-18 21:12:24,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:24,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154533235] [2019-12-18 21:12:24,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:24,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154533235] [2019-12-18 21:12:24,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:24,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:12:24,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901937002] [2019-12-18 21:12:24,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:12:24,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:24,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:12:24,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:12:24,743 INFO L87 Difference]: Start difference. First operand 37101 states and 124278 transitions. Second operand 4 states. [2019-12-18 21:12:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:25,088 INFO L93 Difference]: Finished difference Result 14221 states and 44268 transitions. [2019-12-18 21:12:25,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:12:25,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 21:12:25,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:25,114 INFO L225 Difference]: With dead ends: 14221 [2019-12-18 21:12:25,115 INFO L226 Difference]: Without dead ends: 14221 [2019-12-18 21:12:25,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:12:25,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14221 states. [2019-12-18 21:12:25,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14221 to 14021. [2019-12-18 21:12:25,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14021 states. [2019-12-18 21:12:25,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14021 states to 14021 states and 43688 transitions. [2019-12-18 21:12:25,337 INFO L78 Accepts]: Start accepts. Automaton has 14021 states and 43688 transitions. Word has length 25 [2019-12-18 21:12:25,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:25,337 INFO L462 AbstractCegarLoop]: Abstraction has 14021 states and 43688 transitions. [2019-12-18 21:12:25,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:12:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 14021 states and 43688 transitions. [2019-12-18 21:12:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:12:25,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:25,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:25,358 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:25,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:25,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1050743486, now seen corresponding path program 1 times [2019-12-18 21:12:25,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:25,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459704270] [2019-12-18 21:12:25,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:25,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459704270] [2019-12-18 21:12:25,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:25,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:12:25,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150701594] [2019-12-18 21:12:25,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:12:25,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:25,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:12:25,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:12:25,463 INFO L87 Difference]: Start difference. First operand 14021 states and 43688 transitions. Second operand 5 states. [2019-12-18 21:12:25,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:25,985 INFO L93 Difference]: Finished difference Result 19890 states and 61352 transitions. [2019-12-18 21:12:25,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:12:25,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 21:12:25,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:26,016 INFO L225 Difference]: With dead ends: 19890 [2019-12-18 21:12:26,017 INFO L226 Difference]: Without dead ends: 19890 [2019-12-18 21:12:26,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-18 21:12:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19890 states. [2019-12-18 21:12:26,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19890 to 18261. [2019-12-18 21:12:26,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18261 states. [2019-12-18 21:12:26,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18261 states to 18261 states and 56751 transitions. [2019-12-18 21:12:26,306 INFO L78 Accepts]: Start accepts. Automaton has 18261 states and 56751 transitions. Word has length 39 [2019-12-18 21:12:26,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:26,307 INFO L462 AbstractCegarLoop]: Abstraction has 18261 states and 56751 transitions. [2019-12-18 21:12:26,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:12:26,307 INFO L276 IsEmpty]: Start isEmpty. Operand 18261 states and 56751 transitions. [2019-12-18 21:12:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:12:26,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:26,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:26,332 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:26,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:26,333 INFO L82 PathProgramCache]: Analyzing trace with hash -92841788, now seen corresponding path program 2 times [2019-12-18 21:12:26,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:26,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499743313] [2019-12-18 21:12:26,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:26,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499743313] [2019-12-18 21:12:26,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:26,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:12:26,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351074144] [2019-12-18 21:12:26,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:12:26,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:26,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:12:26,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:12:26,435 INFO L87 Difference]: Start difference. First operand 18261 states and 56751 transitions. Second operand 6 states. [2019-12-18 21:12:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:27,334 INFO L93 Difference]: Finished difference Result 32726 states and 101592 transitions. [2019-12-18 21:12:27,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:12:27,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-18 21:12:27,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:27,384 INFO L225 Difference]: With dead ends: 32726 [2019-12-18 21:12:27,384 INFO L226 Difference]: Without dead ends: 32726 [2019-12-18 21:12:27,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:12:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32726 states. [2019-12-18 21:12:27,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32726 to 20467. [2019-12-18 21:12:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20467 states. [2019-12-18 21:12:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20467 states to 20467 states and 63850 transitions. [2019-12-18 21:12:27,995 INFO L78 Accepts]: Start accepts. Automaton has 20467 states and 63850 transitions. Word has length 39 [2019-12-18 21:12:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:27,995 INFO L462 AbstractCegarLoop]: Abstraction has 20467 states and 63850 transitions. [2019-12-18 21:12:27,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:12:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 20467 states and 63850 transitions. [2019-12-18 21:12:28,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:12:28,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:28,027 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:28,027 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:28,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:28,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1162424668, now seen corresponding path program 3 times [2019-12-18 21:12:28,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:28,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058444249] [2019-12-18 21:12:28,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:28,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058444249] [2019-12-18 21:12:28,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:28,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:12:28,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362919698] [2019-12-18 21:12:28,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:12:28,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:28,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:12:28,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:12:28,134 INFO L87 Difference]: Start difference. First operand 20467 states and 63850 transitions. Second operand 5 states. [2019-12-18 21:12:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:28,236 INFO L93 Difference]: Finished difference Result 18971 states and 59972 transitions. [2019-12-18 21:12:28,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:12:28,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 21:12:28,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:28,279 INFO L225 Difference]: With dead ends: 18971 [2019-12-18 21:12:28,279 INFO L226 Difference]: Without dead ends: 18971 [2019-12-18 21:12:28,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:12:28,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18971 states. [2019-12-18 21:12:28,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18971 to 18185. [2019-12-18 21:12:28,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18185 states. [2019-12-18 21:12:28,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18185 states to 18185 states and 57762 transitions. [2019-12-18 21:12:28,650 INFO L78 Accepts]: Start accepts. Automaton has 18185 states and 57762 transitions. Word has length 39 [2019-12-18 21:12:28,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:28,650 INFO L462 AbstractCegarLoop]: Abstraction has 18185 states and 57762 transitions. [2019-12-18 21:12:28,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:12:28,650 INFO L276 IsEmpty]: Start isEmpty. Operand 18185 states and 57762 transitions. [2019-12-18 21:12:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:12:28,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:28,671 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] [2019-12-18 21:12:28,671 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:28,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:28,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1617433659, now seen corresponding path program 1 times [2019-12-18 21:12:28,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:28,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024435275] [2019-12-18 21:12:28,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:28,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024435275] [2019-12-18 21:12:28,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:28,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:12:28,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332928959] [2019-12-18 21:12:28,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:12:28,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:28,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:12:28,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:28,733 INFO L87 Difference]: Start difference. First operand 18185 states and 57762 transitions. Second operand 3 states. [2019-12-18 21:12:28,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:28,853 INFO L93 Difference]: Finished difference Result 24317 states and 75679 transitions. [2019-12-18 21:12:28,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:12:28,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 21:12:28,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:28,888 INFO L225 Difference]: With dead ends: 24317 [2019-12-18 21:12:28,888 INFO L226 Difference]: Without dead ends: 24317 [2019-12-18 21:12:28,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24317 states. [2019-12-18 21:12:29,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24317 to 19363. [2019-12-18 21:12:29,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19363 states. [2019-12-18 21:12:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19363 states to 19363 states and 61167 transitions. [2019-12-18 21:12:29,222 INFO L78 Accepts]: Start accepts. Automaton has 19363 states and 61167 transitions. Word has length 54 [2019-12-18 21:12:29,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:29,222 INFO L462 AbstractCegarLoop]: Abstraction has 19363 states and 61167 transitions. [2019-12-18 21:12:29,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:12:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 19363 states and 61167 transitions. [2019-12-18 21:12:29,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:12:29,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:29,243 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] [2019-12-18 21:12:29,243 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:29,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:29,244 INFO L82 PathProgramCache]: Analyzing trace with hash -832875013, now seen corresponding path program 1 times [2019-12-18 21:12:29,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:29,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605273407] [2019-12-18 21:12:29,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:29,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605273407] [2019-12-18 21:12:29,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:29,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:12:29,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10935900] [2019-12-18 21:12:29,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:12:29,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:29,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:12:29,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:12:29,609 INFO L87 Difference]: Start difference. First operand 19363 states and 61167 transitions. Second operand 4 states. [2019-12-18 21:12:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:29,794 INFO L93 Difference]: Finished difference Result 34927 states and 110486 transitions. [2019-12-18 21:12:29,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:12:29,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 21:12:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:29,832 INFO L225 Difference]: With dead ends: 34927 [2019-12-18 21:12:29,832 INFO L226 Difference]: Without dead ends: 16145 [2019-12-18 21:12:29,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:12:29,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16145 states. [2019-12-18 21:12:30,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16145 to 16145. [2019-12-18 21:12:30,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16145 states. [2019-12-18 21:12:30,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16145 states to 16145 states and 50929 transitions. [2019-12-18 21:12:30,181 INFO L78 Accepts]: Start accepts. Automaton has 16145 states and 50929 transitions. Word has length 54 [2019-12-18 21:12:30,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:30,182 INFO L462 AbstractCegarLoop]: Abstraction has 16145 states and 50929 transitions. [2019-12-18 21:12:30,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:12:30,182 INFO L276 IsEmpty]: Start isEmpty. Operand 16145 states and 50929 transitions. [2019-12-18 21:12:30,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:12:30,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:30,207 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] [2019-12-18 21:12:30,208 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:30,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:30,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1073450609, now seen corresponding path program 2 times [2019-12-18 21:12:30,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:30,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167119629] [2019-12-18 21:12:30,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:30,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167119629] [2019-12-18 21:12:30,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:30,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:12:30,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218962006] [2019-12-18 21:12:30,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:12:30,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:30,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:12:30,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:12:30,332 INFO L87 Difference]: Start difference. First operand 16145 states and 50929 transitions. Second operand 7 states. [2019-12-18 21:12:30,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:30,745 INFO L93 Difference]: Finished difference Result 43496 states and 135672 transitions. [2019-12-18 21:12:30,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:12:30,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 21:12:30,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:30,807 INFO L225 Difference]: With dead ends: 43496 [2019-12-18 21:12:30,808 INFO L226 Difference]: Without dead ends: 32844 [2019-12-18 21:12:30,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:12:30,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32844 states. [2019-12-18 21:12:31,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32844 to 19560. [2019-12-18 21:12:31,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19560 states. [2019-12-18 21:12:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19560 states to 19560 states and 61621 transitions. [2019-12-18 21:12:31,253 INFO L78 Accepts]: Start accepts. Automaton has 19560 states and 61621 transitions. Word has length 54 [2019-12-18 21:12:31,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:31,253 INFO L462 AbstractCegarLoop]: Abstraction has 19560 states and 61621 transitions. [2019-12-18 21:12:31,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:12:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 19560 states and 61621 transitions. [2019-12-18 21:12:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:12:31,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:31,286 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] [2019-12-18 21:12:31,286 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:31,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:31,286 INFO L82 PathProgramCache]: Analyzing trace with hash -345609331, now seen corresponding path program 3 times [2019-12-18 21:12:31,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:31,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383056593] [2019-12-18 21:12:31,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:31,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383056593] [2019-12-18 21:12:31,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:31,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:12:31,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030811938] [2019-12-18 21:12:31,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:12:31,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:31,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:12:31,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:12:31,367 INFO L87 Difference]: Start difference. First operand 19560 states and 61621 transitions. Second operand 7 states. [2019-12-18 21:12:31,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:31,835 INFO L93 Difference]: Finished difference Result 48152 states and 148272 transitions. [2019-12-18 21:12:31,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:12:31,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 21:12:31,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:31,886 INFO L225 Difference]: With dead ends: 48152 [2019-12-18 21:12:31,886 INFO L226 Difference]: Without dead ends: 34286 [2019-12-18 21:12:31,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:12:32,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34286 states. [2019-12-18 21:12:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34286 to 22798. [2019-12-18 21:12:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22798 states. [2019-12-18 21:12:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22798 states to 22798 states and 71472 transitions. [2019-12-18 21:12:32,551 INFO L78 Accepts]: Start accepts. Automaton has 22798 states and 71472 transitions. Word has length 54 [2019-12-18 21:12:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:32,551 INFO L462 AbstractCegarLoop]: Abstraction has 22798 states and 71472 transitions. [2019-12-18 21:12:32,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:12:32,552 INFO L276 IsEmpty]: Start isEmpty. Operand 22798 states and 71472 transitions. [2019-12-18 21:12:32,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:12:32,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:32,584 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] [2019-12-18 21:12:32,584 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:32,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:32,585 INFO L82 PathProgramCache]: Analyzing trace with hash -682045085, now seen corresponding path program 4 times [2019-12-18 21:12:32,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:32,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552307382] [2019-12-18 21:12:32,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:32,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:32,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552307382] [2019-12-18 21:12:32,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:32,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:12:32,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129752768] [2019-12-18 21:12:32,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:12:32,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:32,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:12:32,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:12:32,668 INFO L87 Difference]: Start difference. First operand 22798 states and 71472 transitions. Second operand 7 states. [2019-12-18 21:12:33,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:33,080 INFO L93 Difference]: Finished difference Result 41097 states and 125805 transitions. [2019-12-18 21:12:33,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 21:12:33,081 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 21:12:33,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:33,134 INFO L225 Difference]: With dead ends: 41097 [2019-12-18 21:12:33,135 INFO L226 Difference]: Without dead ends: 38547 [2019-12-18 21:12:33,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:12:33,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38547 states. [2019-12-18 21:12:33,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38547 to 22943. [2019-12-18 21:12:33,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22943 states. [2019-12-18 21:12:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22943 states to 22943 states and 71970 transitions. [2019-12-18 21:12:33,651 INFO L78 Accepts]: Start accepts. Automaton has 22943 states and 71970 transitions. Word has length 54 [2019-12-18 21:12:33,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:33,651 INFO L462 AbstractCegarLoop]: Abstraction has 22943 states and 71970 transitions. [2019-12-18 21:12:33,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:12:33,651 INFO L276 IsEmpty]: Start isEmpty. Operand 22943 states and 71970 transitions. [2019-12-18 21:12:33,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:12:33,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:33,678 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] [2019-12-18 21:12:33,679 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:33,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:33,679 INFO L82 PathProgramCache]: Analyzing trace with hash -997212989, now seen corresponding path program 1 times [2019-12-18 21:12:33,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:33,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249716609] [2019-12-18 21:12:33,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:33,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249716609] [2019-12-18 21:12:33,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:33,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:12:33,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150348351] [2019-12-18 21:12:33,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:12:33,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:33,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:12:33,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:33,731 INFO L87 Difference]: Start difference. First operand 22943 states and 71970 transitions. Second operand 3 states. [2019-12-18 21:12:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:33,866 INFO L93 Difference]: Finished difference Result 24479 states and 73946 transitions. [2019-12-18 21:12:33,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:12:33,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 21:12:33,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:33,914 INFO L225 Difference]: With dead ends: 24479 [2019-12-18 21:12:33,914 INFO L226 Difference]: Without dead ends: 24479 [2019-12-18 21:12:33,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:34,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24479 states. [2019-12-18 21:12:34,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24479 to 22943. [2019-12-18 21:12:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22943 states. [2019-12-18 21:12:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22943 states to 22943 states and 69456 transitions. [2019-12-18 21:12:34,722 INFO L78 Accepts]: Start accepts. Automaton has 22943 states and 69456 transitions. Word has length 54 [2019-12-18 21:12:34,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:34,722 INFO L462 AbstractCegarLoop]: Abstraction has 22943 states and 69456 transitions. [2019-12-18 21:12:34,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:12:34,722 INFO L276 IsEmpty]: Start isEmpty. Operand 22943 states and 69456 transitions. [2019-12-18 21:12:34,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:12:34,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:34,746 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] [2019-12-18 21:12:34,746 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:34,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:34,746 INFO L82 PathProgramCache]: Analyzing trace with hash -693885685, now seen corresponding path program 5 times [2019-12-18 21:12:34,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:34,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860653979] [2019-12-18 21:12:34,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:34,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860653979] [2019-12-18 21:12:34,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:34,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:12:34,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828403413] [2019-12-18 21:12:34,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:12:34,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:34,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:12:34,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:34,807 INFO L87 Difference]: Start difference. First operand 22943 states and 69456 transitions. Second operand 3 states. [2019-12-18 21:12:34,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:34,880 INFO L93 Difference]: Finished difference Result 16662 states and 49749 transitions. [2019-12-18 21:12:34,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:12:34,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 21:12:34,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:34,906 INFO L225 Difference]: With dead ends: 16662 [2019-12-18 21:12:34,906 INFO L226 Difference]: Without dead ends: 16662 [2019-12-18 21:12:34,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:34,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16662 states. [2019-12-18 21:12:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16662 to 15964. [2019-12-18 21:12:35,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15964 states. [2019-12-18 21:12:35,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15964 states to 15964 states and 47652 transitions. [2019-12-18 21:12:35,143 INFO L78 Accepts]: Start accepts. Automaton has 15964 states and 47652 transitions. Word has length 54 [2019-12-18 21:12:35,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:35,143 INFO L462 AbstractCegarLoop]: Abstraction has 15964 states and 47652 transitions. [2019-12-18 21:12:35,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:12:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 15964 states and 47652 transitions. [2019-12-18 21:12:35,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:12:35,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:35,158 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] [2019-12-18 21:12:35,159 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:35,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:35,159 INFO L82 PathProgramCache]: Analyzing trace with hash 673645833, now seen corresponding path program 1 times [2019-12-18 21:12:35,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:35,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56173512] [2019-12-18 21:12:35,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:35,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56173512] [2019-12-18 21:12:35,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:35,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:12:35,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973423180] [2019-12-18 21:12:35,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:12:35,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:35,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:12:35,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:12:35,276 INFO L87 Difference]: Start difference. First operand 15964 states and 47652 transitions. Second operand 9 states. [2019-12-18 21:12:36,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:36,694 INFO L93 Difference]: Finished difference Result 29348 states and 87177 transitions. [2019-12-18 21:12:36,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 21:12:36,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 21:12:36,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:36,727 INFO L225 Difference]: With dead ends: 29348 [2019-12-18 21:12:36,727 INFO L226 Difference]: Without dead ends: 23194 [2019-12-18 21:12:36,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:12:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23194 states. [2019-12-18 21:12:36,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23194 to 16410. [2019-12-18 21:12:36,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16410 states. [2019-12-18 21:12:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16410 states to 16410 states and 48555 transitions. [2019-12-18 21:12:37,028 INFO L78 Accepts]: Start accepts. Automaton has 16410 states and 48555 transitions. Word has length 55 [2019-12-18 21:12:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:37,029 INFO L462 AbstractCegarLoop]: Abstraction has 16410 states and 48555 transitions. [2019-12-18 21:12:37,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:12:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 16410 states and 48555 transitions. [2019-12-18 21:12:37,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:12:37,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:37,045 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] [2019-12-18 21:12:37,045 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:37,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:37,046 INFO L82 PathProgramCache]: Analyzing trace with hash 483812939, now seen corresponding path program 2 times [2019-12-18 21:12:37,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:37,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138877661] [2019-12-18 21:12:37,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:37,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138877661] [2019-12-18 21:12:37,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:37,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:12:37,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042855455] [2019-12-18 21:12:37,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:12:37,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:37,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:12:37,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:12:37,194 INFO L87 Difference]: Start difference. First operand 16410 states and 48555 transitions. Second operand 10 states. [2019-12-18 21:12:40,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:40,229 INFO L93 Difference]: Finished difference Result 32071 states and 91773 transitions. [2019-12-18 21:12:40,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 21:12:40,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-18 21:12:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:40,270 INFO L225 Difference]: With dead ends: 32071 [2019-12-18 21:12:40,271 INFO L226 Difference]: Without dead ends: 31867 [2019-12-18 21:12:40,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=1107, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 21:12:40,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31867 states. [2019-12-18 21:12:40,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31867 to 17335. [2019-12-18 21:12:40,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17335 states. [2019-12-18 21:12:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17335 states to 17335 states and 51139 transitions. [2019-12-18 21:12:40,628 INFO L78 Accepts]: Start accepts. Automaton has 17335 states and 51139 transitions. Word has length 55 [2019-12-18 21:12:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:40,628 INFO L462 AbstractCegarLoop]: Abstraction has 17335 states and 51139 transitions. [2019-12-18 21:12:40,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:12:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 17335 states and 51139 transitions. [2019-12-18 21:12:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:12:40,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:40,647 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] [2019-12-18 21:12:40,647 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:40,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:40,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1194468433, now seen corresponding path program 3 times [2019-12-18 21:12:40,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:40,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072370524] [2019-12-18 21:12:40,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:40,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:40,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072370524] [2019-12-18 21:12:40,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:40,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:12:40,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577988229] [2019-12-18 21:12:40,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:12:40,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:40,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:12:40,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:12:40,805 INFO L87 Difference]: Start difference. First operand 17335 states and 51139 transitions. Second operand 11 states. [2019-12-18 21:12:41,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:41,889 INFO L93 Difference]: Finished difference Result 33682 states and 98855 transitions. [2019-12-18 21:12:41,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 21:12:41,889 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 21:12:41,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:41,934 INFO L225 Difference]: With dead ends: 33682 [2019-12-18 21:12:41,934 INFO L226 Difference]: Without dead ends: 32592 [2019-12-18 21:12:41,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 21:12:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32592 states. [2019-12-18 21:12:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32592 to 20028. [2019-12-18 21:12:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20028 states. [2019-12-18 21:12:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20028 states to 20028 states and 58694 transitions. [2019-12-18 21:12:42,311 INFO L78 Accepts]: Start accepts. Automaton has 20028 states and 58694 transitions. Word has length 55 [2019-12-18 21:12:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:42,311 INFO L462 AbstractCegarLoop]: Abstraction has 20028 states and 58694 transitions. [2019-12-18 21:12:42,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:12:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 20028 states and 58694 transitions. [2019-12-18 21:12:42,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:12:42,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:42,330 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] [2019-12-18 21:12:42,330 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:42,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:42,330 INFO L82 PathProgramCache]: Analyzing trace with hash -687114287, now seen corresponding path program 4 times [2019-12-18 21:12:42,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:42,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215270011] [2019-12-18 21:12:42,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:42,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215270011] [2019-12-18 21:12:42,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:42,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:12:42,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227284804] [2019-12-18 21:12:42,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:12:42,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:42,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:12:42,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:12:42,772 INFO L87 Difference]: Start difference. First operand 20028 states and 58694 transitions. Second operand 11 states. [2019-12-18 21:12:43,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:43,983 INFO L93 Difference]: Finished difference Result 33086 states and 96245 transitions. [2019-12-18 21:12:43,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 21:12:43,984 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 21:12:43,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:44,019 INFO L225 Difference]: With dead ends: 33086 [2019-12-18 21:12:44,019 INFO L226 Difference]: Without dead ends: 26314 [2019-12-18 21:12:44,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:12:44,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26314 states. [2019-12-18 21:12:44,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26314 to 16352. [2019-12-18 21:12:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16352 states. [2019-12-18 21:12:44,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16352 states to 16352 states and 48262 transitions. [2019-12-18 21:12:44,314 INFO L78 Accepts]: Start accepts. Automaton has 16352 states and 48262 transitions. Word has length 55 [2019-12-18 21:12:44,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:44,314 INFO L462 AbstractCegarLoop]: Abstraction has 16352 states and 48262 transitions. [2019-12-18 21:12:44,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:12:44,315 INFO L276 IsEmpty]: Start isEmpty. Operand 16352 states and 48262 transitions. [2019-12-18 21:12:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:12:44,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:44,329 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] [2019-12-18 21:12:44,330 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:44,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:44,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1007470025, now seen corresponding path program 5 times [2019-12-18 21:12:44,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:44,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932474665] [2019-12-18 21:12:44,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:44,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932474665] [2019-12-18 21:12:44,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:44,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:12:44,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263310277] [2019-12-18 21:12:44,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:12:44,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:44,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:12:44,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:12:44,429 INFO L87 Difference]: Start difference. First operand 16352 states and 48262 transitions. Second operand 7 states. [2019-12-18 21:12:45,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:45,527 INFO L93 Difference]: Finished difference Result 24450 states and 70548 transitions. [2019-12-18 21:12:45,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 21:12:45,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-18 21:12:45,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:45,560 INFO L225 Difference]: With dead ends: 24450 [2019-12-18 21:12:45,560 INFO L226 Difference]: Without dead ends: 24450 [2019-12-18 21:12:45,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:12:45,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24450 states. [2019-12-18 21:12:45,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24450 to 16402. [2019-12-18 21:12:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16402 states. [2019-12-18 21:12:45,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16402 states to 16402 states and 48379 transitions. [2019-12-18 21:12:45,856 INFO L78 Accepts]: Start accepts. Automaton has 16402 states and 48379 transitions. Word has length 55 [2019-12-18 21:12:45,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:45,856 INFO L462 AbstractCegarLoop]: Abstraction has 16402 states and 48379 transitions. [2019-12-18 21:12:45,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:12:45,856 INFO L276 IsEmpty]: Start isEmpty. Operand 16402 states and 48379 transitions. [2019-12-18 21:12:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:12:45,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:45,872 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] [2019-12-18 21:12:45,872 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:45,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:45,873 INFO L82 PathProgramCache]: Analyzing trace with hash -171833141, now seen corresponding path program 6 times [2019-12-18 21:12:45,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:45,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566888123] [2019-12-18 21:12:45,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:45,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566888123] [2019-12-18 21:12:45,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:45,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:12:45,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692895258] [2019-12-18 21:12:45,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:12:45,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:45,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:12:45,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:45,931 INFO L87 Difference]: Start difference. First operand 16402 states and 48379 transitions. Second operand 3 states. [2019-12-18 21:12:45,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:45,997 INFO L93 Difference]: Finished difference Result 16400 states and 48374 transitions. [2019-12-18 21:12:45,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:12:45,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:12:45,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:46,023 INFO L225 Difference]: With dead ends: 16400 [2019-12-18 21:12:46,023 INFO L226 Difference]: Without dead ends: 16400 [2019-12-18 21:12:46,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16400 states. [2019-12-18 21:12:46,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16400 to 13129. [2019-12-18 21:12:46,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13129 states. [2019-12-18 21:12:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13129 states to 13129 states and 39378 transitions. [2019-12-18 21:12:46,242 INFO L78 Accepts]: Start accepts. Automaton has 13129 states and 39378 transitions. Word has length 55 [2019-12-18 21:12:46,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:46,243 INFO L462 AbstractCegarLoop]: Abstraction has 13129 states and 39378 transitions. [2019-12-18 21:12:46,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:12:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 13129 states and 39378 transitions. [2019-12-18 21:12:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:12:46,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:46,257 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] [2019-12-18 21:12:46,257 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:46,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:46,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1213693398, now seen corresponding path program 1 times [2019-12-18 21:12:46,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:46,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503878184] [2019-12-18 21:12:46,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:46,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:46,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503878184] [2019-12-18 21:12:46,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:46,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 21:12:46,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955680868] [2019-12-18 21:12:46,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 21:12:46,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:46,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 21:12:46,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 21:12:46,729 INFO L87 Difference]: Start difference. First operand 13129 states and 39378 transitions. Second operand 16 states. [2019-12-18 21:12:47,125 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2019-12-18 21:12:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:50,084 INFO L93 Difference]: Finished difference Result 23076 states and 68082 transitions. [2019-12-18 21:12:50,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 21:12:50,085 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 21:12:50,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:50,118 INFO L225 Difference]: With dead ends: 23076 [2019-12-18 21:12:50,118 INFO L226 Difference]: Without dead ends: 22738 [2019-12-18 21:12:50,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=439, Invalid=2111, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 21:12:50,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22738 states. [2019-12-18 21:12:50,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22738 to 12983. [2019-12-18 21:12:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12983 states. [2019-12-18 21:12:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12983 states to 12983 states and 39034 transitions. [2019-12-18 21:12:50,380 INFO L78 Accepts]: Start accepts. Automaton has 12983 states and 39034 transitions. Word has length 56 [2019-12-18 21:12:50,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:50,381 INFO L462 AbstractCegarLoop]: Abstraction has 12983 states and 39034 transitions. [2019-12-18 21:12:50,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 21:12:50,381 INFO L276 IsEmpty]: Start isEmpty. Operand 12983 states and 39034 transitions. [2019-12-18 21:12:50,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:12:50,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:50,395 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] [2019-12-18 21:12:50,395 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:50,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:50,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1135634574, now seen corresponding path program 2 times [2019-12-18 21:12:50,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:50,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115714474] [2019-12-18 21:12:50,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:12:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:12:50,490 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:12:50,490 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:12:50,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t928~0.base_21| 4)) (= 0 v_~a~0_9) (= v_~x$r_buff1_thd2~0_17 0) (= v_~main$tmp_guard1~0_18 0) (= |v_ULTIMATE.start_main_~#t928~0.offset_16| 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t928~0.base_21|) (= v_~x$w_buff1_used~0_63 0) (= v_~x$r_buff1_thd0~0_17 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~__unbuffered_cnt~0_20) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~x$w_buff1~0_25) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 0 v_~x$r_buff0_thd0~0_20) (= v_~x~0_24 0) (= v_~main$tmp_guard0~0_8 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~z~0_7) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_39 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice0~0_7) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$r_buff0_thd1~0_71) (= v_~x$mem_tmp~0_10 0) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t928~0.base_21| 1)) (= 0 v_~x$r_buff0_thd3~0_20) (= v_~x$flush_delayed~0_12 0) (= 0 v_~x$w_buff0_used~0_109) (= |v_#NULL.offset_4| 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t928~0.base_21|)) (= v_~y~0_10 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t928~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t928~0.base_21|) |v_ULTIMATE.start_main_~#t928~0.offset_16| 0)) |v_#memory_int_23|) (= 0 v_~weak$$choice2~0_31) (= 0 v_~x$w_buff0~0_28))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, ULTIMATE.start_main_~#t929~0.offset=|v_ULTIMATE.start_main_~#t929~0.offset_16|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_39, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~a~0=v_~a~0_9, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_~#t929~0.base=|v_ULTIMATE.start_main_~#t929~0.base_20|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ULTIMATE.start_main_~#t930~0.offset=|v_ULTIMATE.start_main_~#t930~0.offset_15|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_63, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t928~0.offset=|v_ULTIMATE.start_main_~#t928~0.offset_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_24, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ULTIMATE.start_main_~#t930~0.base=|v_ULTIMATE.start_main_~#t930~0.base_19|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_17, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t928~0.base=|v_ULTIMATE.start_main_~#t928~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_7, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t929~0.offset, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t929~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t930~0.offset, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t928~0.offset, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t930~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t928~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 21:12:50,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L828-1-->L830: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t929~0.base_13|) 0) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t929~0.base_13| 1) |v_#valid_36|) (= |v_ULTIMATE.start_main_~#t929~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t929~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t929~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t929~0.base_13|) |v_ULTIMATE.start_main_~#t929~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t929~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t929~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t929~0.offset=|v_ULTIMATE.start_main_~#t929~0.offset_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t929~0.base=|v_ULTIMATE.start_main_~#t929~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t929~0.offset, #length, ULTIMATE.start_main_~#t929~0.base] because there is no mapped edge [2019-12-18 21:12:50,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L830-1-->L832: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t930~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t930~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t930~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t930~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t930~0.base_13|) |v_ULTIMATE.start_main_~#t930~0.offset_11| 2)) |v_#memory_int_17|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t930~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t930~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t930~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t930~0.offset=|v_ULTIMATE.start_main_~#t930~0.offset_11|, ULTIMATE.start_main_~#t930~0.base=|v_ULTIMATE.start_main_~#t930~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t930~0.offset, ULTIMATE.start_main_~#t930~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 21:12:50,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] P1ENTRY-->L5-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~x$w_buff1_used~0_41 v_~x$w_buff0_used~0_70) (= 1 v_~x$w_buff0_used~0_69) (= v_~x$w_buff0~0_16 v_~x$w_buff1~0_13) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= (mod v_~x$w_buff1_used~0_41 256) 0) (= 1 v_~x$w_buff0~0_15)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 21:12:50,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In-560324503 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-560324503 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In-560324503 |P2Thread1of1ForFork2_#t~ite32_Out-560324503|)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite32_Out-560324503| ~x$w_buff1~0_In-560324503) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-560324503, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-560324503, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-560324503, ~x~0=~x~0_In-560324503} OutVars{P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out-560324503|, ~x$w_buff1~0=~x$w_buff1~0_In-560324503, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-560324503, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-560324503, ~x~0=~x~0_In-560324503} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-18 21:12:50,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-300257878 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-300257878 256)))) (or (and (= ~x$w_buff0_used~0_In-300257878 |P1Thread1of1ForFork1_#t~ite28_Out-300257878|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-300257878|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-300257878, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-300257878} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-300257878, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-300257878|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-300257878} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 21:12:50,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L805-4-->L806: Formula: (= |v_P2Thread1of1ForFork2_#t~ite32_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_8|} OutVars{P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~x~0] because there is no mapped edge [2019-12-18 21:12:50,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1029101794 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1029101794 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite34_Out-1029101794| 0)) (and (= |P2Thread1of1ForFork2_#t~ite34_Out-1029101794| ~x$w_buff0_used~0_In-1029101794) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1029101794, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1029101794} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out-1029101794|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1029101794, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1029101794} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-18 21:12:50,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L807-->L807-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In130058247 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In130058247 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In130058247 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In130058247 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite35_Out130058247| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In130058247 |P2Thread1of1ForFork2_#t~ite35_Out130058247|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In130058247, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In130058247, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In130058247, ~x$w_buff0_used~0=~x$w_buff0_used~0_In130058247} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out130058247|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In130058247, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In130058247, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In130058247, ~x$w_buff0_used~0=~x$w_buff0_used~0_In130058247} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-18 21:12:50,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In916168381 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In916168381 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In916168381 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In916168381 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite29_Out916168381|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In916168381 |P1Thread1of1ForFork1_#t~ite29_Out916168381|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In916168381, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In916168381, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In916168381, ~x$w_buff0_used~0=~x$w_buff0_used~0_In916168381} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out916168381|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In916168381, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In916168381, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In916168381, ~x$w_buff0_used~0=~x$w_buff0_used~0_In916168381} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 21:12:50,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L782-->L783: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In983319071 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In983319071 256) 0))) (or (and (= 0 ~x$r_buff0_thd2~0_Out983319071) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In983319071 ~x$r_buff0_thd2~0_Out983319071) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In983319071, ~x$w_buff0_used~0=~x$w_buff0_used~0_In983319071} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out983319071|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out983319071, ~x$w_buff0_used~0=~x$w_buff0_used~0_In983319071} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 21:12:50,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In2120859754 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2120859754 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In2120859754 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In2120859754 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In2120859754 |P1Thread1of1ForFork1_#t~ite31_Out2120859754|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite31_Out2120859754|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2120859754, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2120859754, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2120859754, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2120859754} OutVars{P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out2120859754|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2120859754, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2120859754, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2120859754, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2120859754} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 21:12:50,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite31_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:12:50,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1380445295 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite11_In-1380445295| |P0Thread1of1ForFork0_#t~ite11_Out-1380445295|) (= ~x$w_buff1~0_In-1380445295 |P0Thread1of1ForFork0_#t~ite12_Out-1380445295|)) (and (= |P0Thread1of1ForFork0_#t~ite12_Out-1380445295| |P0Thread1of1ForFork0_#t~ite11_Out-1380445295|) (= ~x$w_buff1~0_In-1380445295 |P0Thread1of1ForFork0_#t~ite11_Out-1380445295|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1380445295 256)))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1380445295 256))) (and (= 0 (mod ~x$r_buff1_thd1~0_In-1380445295 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-1380445295 256))))))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In-1380445295|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1380445295, ~x$w_buff1~0=~x$w_buff1~0_In-1380445295, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1380445295, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1380445295, ~weak$$choice2~0=~weak$$choice2~0_In-1380445295, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1380445295} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-1380445295|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1380445295, ~x$w_buff1~0=~x$w_buff1~0_In-1380445295, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1380445295, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1380445295, ~weak$$choice2~0=~weak$$choice2~0_In-1380445295, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-1380445295|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1380445295} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 21:12:50,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L746-->L746-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-726690700 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite14_In-726690700| |P0Thread1of1ForFork0_#t~ite14_Out-726690700|) (= |P0Thread1of1ForFork0_#t~ite15_Out-726690700| ~x$w_buff0_used~0_In-726690700) (not .cse0)) (and (= |P0Thread1of1ForFork0_#t~ite15_Out-726690700| |P0Thread1of1ForFork0_#t~ite14_Out-726690700|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-726690700 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-726690700 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In-726690700 256) 0)) (and (= 0 (mod ~x$r_buff1_thd1~0_In-726690700 256)) .cse1))) (= ~x$w_buff0_used~0_In-726690700 |P0Thread1of1ForFork0_#t~ite14_Out-726690700|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-726690700, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-726690700, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-726690700, ~weak$$choice2~0=~weak$$choice2~0_In-726690700, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_In-726690700|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-726690700} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-726690700, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-726690700, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-726690700, P0Thread1of1ForFork0_#t~ite15=|P0Thread1of1ForFork0_#t~ite15_Out-726690700|, ~weak$$choice2~0=~weak$$choice2~0_In-726690700, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out-726690700|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-726690700} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite15, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 21:12:50,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L748-->L749: Formula: (and (= v_~x$r_buff0_thd1~0_45 v_~x$r_buff0_thd1~0_44) (not (= (mod v_~weak$$choice2~0_19 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_45, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_7|, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, ~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite20, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-18 21:12:50,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L751-->L759: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~x$mem_tmp~0_5 v_~x~0_19) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 21:12:50,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1493213808 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1493213808 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite36_Out1493213808|) (not .cse1)) (and (= ~x$r_buff0_thd3~0_In1493213808 |P2Thread1of1ForFork2_#t~ite36_Out1493213808|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1493213808, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1493213808} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out1493213808|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1493213808, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1493213808} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-18 21:12:50,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd3~0_In-1963992970 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1963992970 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1963992970 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1963992970 256)))) (or (and (= ~x$r_buff1_thd3~0_In-1963992970 |P2Thread1of1ForFork2_#t~ite37_Out-1963992970|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite37_Out-1963992970|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1963992970, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1963992970, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1963992970, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1963992970} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out-1963992970|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1963992970, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1963992970, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1963992970, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1963992970} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-18 21:12:50,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite37_8| v_~x$r_buff1_thd3~0_13) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 21:12:50,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L838: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:12:50,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L838-2-->L838-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In2052208602 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In2052208602 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out2052208602| ~x~0_In2052208602) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In2052208602 |ULTIMATE.start_main_#t~ite41_Out2052208602|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2052208602, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2052208602, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2052208602, ~x~0=~x~0_In2052208602} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out2052208602|, ~x$w_buff1~0=~x$w_buff1~0_In2052208602, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2052208602, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2052208602, ~x~0=~x~0_In2052208602} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 21:12:50,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L838-4-->L839: Formula: (= v_~x~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 21:12:50,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L839-->L839-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1631401267 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1631401267 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1631401267| ~x$w_buff0_used~0_In1631401267) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out1631401267| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1631401267, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1631401267} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1631401267, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1631401267|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1631401267} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 21:12:50,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L840-->L840-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In710054717 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In710054717 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In710054717 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In710054717 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out710054717|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite44_Out710054717| ~x$w_buff1_used~0_In710054717) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In710054717, ~x$w_buff1_used~0=~x$w_buff1_used~0_In710054717, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In710054717, ~x$w_buff0_used~0=~x$w_buff0_used~0_In710054717} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In710054717, ~x$w_buff1_used~0=~x$w_buff1_used~0_In710054717, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In710054717, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out710054717|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In710054717} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:12:50,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1314792029 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1314792029 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out1314792029|)) (and (= |ULTIMATE.start_main_#t~ite45_Out1314792029| ~x$r_buff0_thd0~0_In1314792029) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1314792029, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1314792029} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1314792029, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1314792029|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1314792029} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:12:50,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-9883406 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-9883406 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-9883406 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-9883406 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-9883406|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In-9883406 |ULTIMATE.start_main_#t~ite46_Out-9883406|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-9883406, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-9883406, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-9883406, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-9883406} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-9883406, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-9883406|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-9883406, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-9883406, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-9883406} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 21:12:50,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L842-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_15 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite46_10|) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~__unbuffered_p2_EBX~0_8 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:12:50,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:12:50 BasicIcfg [2019-12-18 21:12:50,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:12:50,605 INFO L168 Benchmark]: Toolchain (without parser) took 70934.68 ms. Allocated memory was 146.8 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 101.3 MB in the beginning and 1.1 GB in the end (delta: -984.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 21:12:50,605 INFO L168 Benchmark]: CDTParser took 1.36 ms. Allocated memory is still 146.8 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 21:12:50,606 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.21 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 101.1 MB in the beginning and 157.9 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:12:50,607 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.69 ms. Allocated memory is still 204.5 MB. Free memory was 157.9 MB in the beginning and 155.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:12:50,607 INFO L168 Benchmark]: Boogie Preprocessor took 39.41 ms. Allocated memory is still 204.5 MB. Free memory was 155.3 MB in the beginning and 152.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:12:50,608 INFO L168 Benchmark]: RCFGBuilder took 786.08 ms. Allocated memory is still 204.5 MB. Free memory was 152.8 MB in the beginning and 105.9 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:12:50,608 INFO L168 Benchmark]: TraceAbstraction took 69304.05 ms. Allocated memory was 204.5 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 105.2 MB in the beginning and 1.1 GB in the end (delta: -980.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 21:12:50,611 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.36 ms. Allocated memory is still 146.8 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 735.21 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 101.1 MB in the beginning and 157.9 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.69 ms. Allocated memory is still 204.5 MB. Free memory was 157.9 MB in the beginning and 155.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.41 ms. Allocated memory is still 204.5 MB. Free memory was 155.3 MB in the beginning and 152.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 786.08 ms. Allocated memory is still 204.5 MB. Free memory was 152.8 MB in the beginning and 105.9 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 69304.05 ms. Allocated memory was 204.5 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 105.2 MB in the beginning and 1.1 GB in the end (delta: -980.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 166 ProgramPointsBefore, 86 ProgramPointsAfterwards, 197 TransitionsBefore, 96 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 6251 VarBasedMoverChecksPositive, 206 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 71962 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L828] FCALL, FORK 0 pthread_create(&t928, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t929, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t930, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L769] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L770] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L771] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L772] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L773] 2 x$r_buff0_thd2 = (_Bool)1 [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L793] 3 y = 1 [L796] 3 z = 1 [L799] 3 __unbuffered_p2_EAX = z [L802] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L779] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L806] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L736] 1 a = 1 [L739] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L740] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L741] 1 x$flush_delayed = weak$$choice2 [L742] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L744] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L745] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L746] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L747] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L838] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L840] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L841] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 68.9s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 24.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5196 SDtfs, 6400 SDslu, 17937 SDs, 0 SdLazy, 10623 SolverSat, 302 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 48 SyntacticMatches, 15 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101822occurred 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: 21.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 158002 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1029 NumberOfCodeBlocks, 1029 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 950 ConstructedInterpolants, 0 QuantifiedInterpolants, 166816 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...