/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:38:38,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:38:38,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:38:38,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:38:38,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:38:38,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:38:38,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:38:38,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:38:38,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:38:38,269 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:38:38,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:38:38,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:38:38,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:38:38,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:38:38,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:38:38,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:38:38,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:38:38,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:38:38,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:38:38,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:38:38,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:38:38,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:38:38,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:38:38,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:38:38,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:38:38,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:38:38,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:38:38,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:38:38,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:38:38,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:38:38,290 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:38:38,291 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:38:38,292 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:38:38,293 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:38:38,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:38:38,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:38:38,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:38:38,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:38:38,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:38:38,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:38:38,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:38:38,300 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:38:38,323 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:38:38,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:38:38,327 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:38:38,328 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:38:38,328 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:38:38,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:38:38,328 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:38:38,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:38:38,329 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:38:38,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:38:38,330 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:38:38,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:38:38,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:38:38,331 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:38:38,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:38:38,331 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:38:38,331 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:38:38,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:38:38,332 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:38:38,332 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:38:38,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:38:38,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:38:38,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:38:38,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:38:38,333 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:38:38,333 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:38:38,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:38:38,334 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:38:38,334 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:38:38,334 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:38:38,670 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:38:38,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:38:38,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:38:38,697 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:38:38,697 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:38:38,698 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.opt.i [2019-12-18 14:38:38,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4441a867b/044c0c24bc4b4fb88003d10ad84c4c9b/FLAG2da38f252 [2019-12-18 14:38:39,336 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:38:39,337 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.opt.i [2019-12-18 14:38:39,352 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4441a867b/044c0c24bc4b4fb88003d10ad84c4c9b/FLAG2da38f252 [2019-12-18 14:38:39,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4441a867b/044c0c24bc4b4fb88003d10ad84c4c9b [2019-12-18 14:38:39,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:38:39,629 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:38:39,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:38:39,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:38:39,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:38:39,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:38:39" (1/1) ... [2019-12-18 14:38:39,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e483e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:39, skipping insertion in model container [2019-12-18 14:38:39,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:38:39" (1/1) ... [2019-12-18 14:38:39,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:38:39,706 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:38:40,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:38:40,255 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:38:40,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:38:40,427 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:38:40,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:40 WrapperNode [2019-12-18 14:38:40,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:38:40,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:38:40,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:38:40,429 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:38:40,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:40" (1/1) ... [2019-12-18 14:38:40,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:40" (1/1) ... [2019-12-18 14:38:40,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:38:40,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:38:40,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:38:40,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:38:40,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:40" (1/1) ... [2019-12-18 14:38:40,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:40" (1/1) ... [2019-12-18 14:38:40,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:40" (1/1) ... [2019-12-18 14:38:40,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:40" (1/1) ... [2019-12-18 14:38:40,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:40" (1/1) ... [2019-12-18 14:38:40,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:40" (1/1) ... [2019-12-18 14:38:40,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:40" (1/1) ... [2019-12-18 14:38:40,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:38:40,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:38:40,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:38:40,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:38:40,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38: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 14:38:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:38:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:38:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:38:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:38:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:38:40,603 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:38:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:38:40,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:38:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:38:40,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:38:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:38:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:38:40,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:38:40,607 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 14:38:41,337 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:38:41,337 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:38:41,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:38:41 BoogieIcfgContainer [2019-12-18 14:38:41,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:38:41,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:38:41,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:38:41,344 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:38:41,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:38:39" (1/3) ... [2019-12-18 14:38:41,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497b4a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:38:41, skipping insertion in model container [2019-12-18 14:38:41,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:40" (2/3) ... [2019-12-18 14:38:41,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497b4a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:38:41, skipping insertion in model container [2019-12-18 14:38:41,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:38:41" (3/3) ... [2019-12-18 14:38:41,349 INFO L109 eAbstractionObserver]: Analyzing ICFG safe012_pso.opt.i [2019-12-18 14:38:41,360 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:38:41,360 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:38:41,373 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:38:41,375 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:38:41,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,445 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,446 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,513 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,513 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,513 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,515 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,515 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,531 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,531 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,540 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,541 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,541 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,547 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,547 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,551 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,552 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:41,571 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:38:41,591 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:38:41,591 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:38:41,591 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:38:41,591 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:38:41,591 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:38:41,591 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:38:41,592 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:38:41,592 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:38:41,609 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 14:38:41,611 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 14:38:41,699 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 14:38:41,699 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:38:41,719 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:38:41,745 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 14:38:41,789 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 14:38:41,790 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:38:41,797 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:38:41,817 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 14:38:41,818 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:38:47,485 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 14:38:47,612 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 14:38:47,708 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64821 [2019-12-18 14:38:47,708 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 14:38:47,713 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 89 transitions [2019-12-18 14:38:57,435 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80192 states. [2019-12-18 14:38:57,437 INFO L276 IsEmpty]: Start isEmpty. Operand 80192 states. [2019-12-18 14:38:57,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:38:57,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:57,443 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:38:57,443 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:57,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:57,448 INFO L82 PathProgramCache]: Analyzing trace with hash 801165869, now seen corresponding path program 1 times [2019-12-18 14:38:57,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:57,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626778475] [2019-12-18 14:38:57,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:57,802 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 14:38:57,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626778475] [2019-12-18 14:38:57,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:57,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:38:57,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648793395] [2019-12-18 14:38:57,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:38:57,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:57,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:38:57,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:38:57,828 INFO L87 Difference]: Start difference. First operand 80192 states. Second operand 3 states. [2019-12-18 14:39:01,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:01,203 INFO L93 Difference]: Finished difference Result 79136 states and 341584 transitions. [2019-12-18 14:39:01,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:39:01,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:39:01,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:01,763 INFO L225 Difference]: With dead ends: 79136 [2019-12-18 14:39:01,763 INFO L226 Difference]: Without dead ends: 74600 [2019-12-18 14:39:01,765 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 14:39:04,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74600 states. [2019-12-18 14:39:08,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74600 to 74600. [2019-12-18 14:39:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74600 states. [2019-12-18 14:39:08,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74600 states to 74600 states and 321550 transitions. [2019-12-18 14:39:08,682 INFO L78 Accepts]: Start accepts. Automaton has 74600 states and 321550 transitions. Word has length 5 [2019-12-18 14:39:08,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:08,683 INFO L462 AbstractCegarLoop]: Abstraction has 74600 states and 321550 transitions. [2019-12-18 14:39:08,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:39:08,683 INFO L276 IsEmpty]: Start isEmpty. Operand 74600 states and 321550 transitions. [2019-12-18 14:39:08,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:39:08,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:08,692 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:08,693 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:08,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:08,693 INFO L82 PathProgramCache]: Analyzing trace with hash 144866957, now seen corresponding path program 1 times [2019-12-18 14:39:08,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:08,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970902487] [2019-12-18 14:39:08,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:08,810 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 14:39:08,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970902487] [2019-12-18 14:39:08,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:08,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:39:08,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969389704] [2019-12-18 14:39:08,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:39:08,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:08,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:39:08,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:39:08,814 INFO L87 Difference]: Start difference. First operand 74600 states and 321550 transitions. Second operand 4 states. [2019-12-18 14:39:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:12,433 INFO L93 Difference]: Finished difference Result 114840 states and 473340 transitions. [2019-12-18 14:39:12,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:39:12,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:39:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:13,107 INFO L225 Difference]: With dead ends: 114840 [2019-12-18 14:39:13,107 INFO L226 Difference]: Without dead ends: 114749 [2019-12-18 14:39:13,108 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 14:39:16,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114749 states. [2019-12-18 14:39:18,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114749 to 106549. [2019-12-18 14:39:18,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106549 states. [2019-12-18 14:39:19,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106549 states to 106549 states and 443513 transitions. [2019-12-18 14:39:19,258 INFO L78 Accepts]: Start accepts. Automaton has 106549 states and 443513 transitions. Word has length 13 [2019-12-18 14:39:19,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:19,259 INFO L462 AbstractCegarLoop]: Abstraction has 106549 states and 443513 transitions. [2019-12-18 14:39:19,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:39:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand 106549 states and 443513 transitions. [2019-12-18 14:39:19,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:39:19,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:19,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:19,264 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:19,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:19,264 INFO L82 PathProgramCache]: Analyzing trace with hash 483707300, now seen corresponding path program 1 times [2019-12-18 14:39:19,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:19,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763438411] [2019-12-18 14:39:19,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:19,335 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 14:39:19,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763438411] [2019-12-18 14:39:19,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:19,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:39:19,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754714766] [2019-12-18 14:39:19,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:39:19,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:19,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:39:19,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:39:19,339 INFO L87 Difference]: Start difference. First operand 106549 states and 443513 transitions. Second operand 4 states. [2019-12-18 14:39:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:24,078 INFO L93 Difference]: Finished difference Result 148763 states and 604775 transitions. [2019-12-18 14:39:24,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:39:24,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:39:24,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:24,591 INFO L225 Difference]: With dead ends: 148763 [2019-12-18 14:39:24,591 INFO L226 Difference]: Without dead ends: 148659 [2019-12-18 14:39:24,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:39:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148659 states. [2019-12-18 14:39:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148659 to 126910. [2019-12-18 14:39:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126910 states. [2019-12-18 14:39:31,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126910 states to 126910 states and 524476 transitions. [2019-12-18 14:39:31,589 INFO L78 Accepts]: Start accepts. Automaton has 126910 states and 524476 transitions. Word has length 13 [2019-12-18 14:39:31,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:31,590 INFO L462 AbstractCegarLoop]: Abstraction has 126910 states and 524476 transitions. [2019-12-18 14:39:31,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:39:31,590 INFO L276 IsEmpty]: Start isEmpty. Operand 126910 states and 524476 transitions. [2019-12-18 14:39:31,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:39:31,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:31,595 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:31,595 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:31,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:31,595 INFO L82 PathProgramCache]: Analyzing trace with hash 145051196, now seen corresponding path program 1 times [2019-12-18 14:39:31,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:31,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922954593] [2019-12-18 14:39:31,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:31,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 14:39:31,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922954593] [2019-12-18 14:39:31,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:31,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:39:31,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782306099] [2019-12-18 14:39:31,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:39:31,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:31,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:39:31,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:39:31,669 INFO L87 Difference]: Start difference. First operand 126910 states and 524476 transitions. Second operand 5 states. [2019-12-18 14:39:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:37,846 INFO L93 Difference]: Finished difference Result 172949 states and 700308 transitions. [2019-12-18 14:39:37,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:39:37,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 14:39:37,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:38,329 INFO L225 Difference]: With dead ends: 172949 [2019-12-18 14:39:38,329 INFO L226 Difference]: Without dead ends: 172813 [2019-12-18 14:39:38,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:39:42,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172813 states. [2019-12-18 14:39:44,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172813 to 134187. [2019-12-18 14:39:44,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134187 states. [2019-12-18 14:39:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134187 states to 134187 states and 553595 transitions. [2019-12-18 14:39:45,511 INFO L78 Accepts]: Start accepts. Automaton has 134187 states and 553595 transitions. Word has length 14 [2019-12-18 14:39:45,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:45,512 INFO L462 AbstractCegarLoop]: Abstraction has 134187 states and 553595 transitions. [2019-12-18 14:39:45,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:39:45,512 INFO L276 IsEmpty]: Start isEmpty. Operand 134187 states and 553595 transitions. [2019-12-18 14:39:45,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 14:39:45,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:45,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:45,536 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:45,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:45,537 INFO L82 PathProgramCache]: Analyzing trace with hash -448648622, now seen corresponding path program 1 times [2019-12-18 14:39:45,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:45,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136953854] [2019-12-18 14:39:45,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:45,648 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 14:39:45,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136953854] [2019-12-18 14:39:45,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:45,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:39:45,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642808249] [2019-12-18 14:39:45,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:39:45,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:45,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:39:45,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:39:45,650 INFO L87 Difference]: Start difference. First operand 134187 states and 553595 transitions. Second operand 3 states. [2019-12-18 14:39:46,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:46,298 INFO L93 Difference]: Finished difference Result 133799 states and 552073 transitions. [2019-12-18 14:39:46,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:39:46,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 14:39:46,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:52,204 INFO L225 Difference]: With dead ends: 133799 [2019-12-18 14:39:52,204 INFO L226 Difference]: Without dead ends: 133799 [2019-12-18 14:39:52,204 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 14:39:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133799 states. [2019-12-18 14:39:57,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133799 to 133799. [2019-12-18 14:39:57,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133799 states. [2019-12-18 14:39:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133799 states to 133799 states and 552073 transitions. [2019-12-18 14:39:57,780 INFO L78 Accepts]: Start accepts. Automaton has 133799 states and 552073 transitions. Word has length 18 [2019-12-18 14:39:57,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:57,781 INFO L462 AbstractCegarLoop]: Abstraction has 133799 states and 552073 transitions. [2019-12-18 14:39:57,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:39:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 133799 states and 552073 transitions. [2019-12-18 14:39:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:39:57,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:57,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:57,804 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:57,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:57,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1144737546, now seen corresponding path program 1 times [2019-12-18 14:39:57,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:57,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92361911] [2019-12-18 14:39:57,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:57,853 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 14:39:57,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92361911] [2019-12-18 14:39:57,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:57,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:39:57,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738855471] [2019-12-18 14:39:57,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:39:57,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:57,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:39:57,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:39:57,855 INFO L87 Difference]: Start difference. First operand 133799 states and 552073 transitions. Second operand 4 states. [2019-12-18 14:40:00,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:00,274 INFO L93 Difference]: Finished difference Result 243998 states and 1008264 transitions. [2019-12-18 14:40:00,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:40:00,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 14:40:00,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:00,694 INFO L225 Difference]: With dead ends: 243998 [2019-12-18 14:40:00,694 INFO L226 Difference]: Without dead ends: 133380 [2019-12-18 14:40:00,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 14:40:10,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133380 states. [2019-12-18 14:40:12,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133380 to 132604. [2019-12-18 14:40:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132604 states. [2019-12-18 14:40:12,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132604 states to 132604 states and 541797 transitions. [2019-12-18 14:40:12,563 INFO L78 Accepts]: Start accepts. Automaton has 132604 states and 541797 transitions. Word has length 19 [2019-12-18 14:40:12,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:12,564 INFO L462 AbstractCegarLoop]: Abstraction has 132604 states and 541797 transitions. [2019-12-18 14:40:12,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:40:12,564 INFO L276 IsEmpty]: Start isEmpty. Operand 132604 states and 541797 transitions. [2019-12-18 14:40:12,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:40:12,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:12,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:40:12,580 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:12,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:12,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1997587133, now seen corresponding path program 1 times [2019-12-18 14:40:12,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:12,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992413253] [2019-12-18 14:40:12,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:12,690 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 14:40:12,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992413253] [2019-12-18 14:40:12,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:12,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:40:12,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389382881] [2019-12-18 14:40:12,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:40:12,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:12,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:40:12,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:40:12,693 INFO L87 Difference]: Start difference. First operand 132604 states and 541797 transitions. Second operand 5 states. [2019-12-18 14:40:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:15,119 INFO L93 Difference]: Finished difference Result 182821 states and 731119 transitions. [2019-12-18 14:40:15,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:40:15,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 14:40:15,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:15,682 INFO L225 Difference]: With dead ends: 182821 [2019-12-18 14:40:15,682 INFO L226 Difference]: Without dead ends: 181141 [2019-12-18 14:40:15,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:40:25,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181141 states. [2019-12-18 14:40:27,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181141 to 137168. [2019-12-18 14:40:27,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137168 states. [2019-12-18 14:40:27,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137168 states to 137168 states and 559766 transitions. [2019-12-18 14:40:27,956 INFO L78 Accepts]: Start accepts. Automaton has 137168 states and 559766 transitions. Word has length 19 [2019-12-18 14:40:27,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:27,957 INFO L462 AbstractCegarLoop]: Abstraction has 137168 states and 559766 transitions. [2019-12-18 14:40:27,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:40:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 137168 states and 559766 transitions. [2019-12-18 14:40:27,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 14:40:27,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:27,976 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] [2019-12-18 14:40:27,976 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:27,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:27,976 INFO L82 PathProgramCache]: Analyzing trace with hash 826616842, now seen corresponding path program 1 times [2019-12-18 14:40:27,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:27,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643666254] [2019-12-18 14:40:27,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:40:28,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643666254] [2019-12-18 14:40:28,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:28,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:40:28,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859962503] [2019-12-18 14:40:28,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:40:28,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:28,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:40:28,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:40:28,032 INFO L87 Difference]: Start difference. First operand 137168 states and 559766 transitions. Second operand 4 states. [2019-12-18 14:40:30,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:30,376 INFO L93 Difference]: Finished difference Result 208641 states and 859416 transitions. [2019-12-18 14:40:30,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:40:30,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-18 14:40:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:30,670 INFO L225 Difference]: With dead ends: 208641 [2019-12-18 14:40:30,670 INFO L226 Difference]: Without dead ends: 95129 [2019-12-18 14:40:30,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 14:40:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95129 states. [2019-12-18 14:40:41,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95129 to 88607. [2019-12-18 14:40:41,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88607 states. [2019-12-18 14:40:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88607 states to 88607 states and 363903 transitions. [2019-12-18 14:40:42,105 INFO L78 Accepts]: Start accepts. Automaton has 88607 states and 363903 transitions. Word has length 20 [2019-12-18 14:40:42,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:42,105 INFO L462 AbstractCegarLoop]: Abstraction has 88607 states and 363903 transitions. [2019-12-18 14:40:42,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:40:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 88607 states and 363903 transitions. [2019-12-18 14:40:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 14:40:42,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:42,121 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] [2019-12-18 14:40:42,121 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:42,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:42,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1336681809, now seen corresponding path program 1 times [2019-12-18 14:40:42,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:42,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848722419] [2019-12-18 14:40:42,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:42,200 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 14:40:42,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848722419] [2019-12-18 14:40:42,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:42,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:40:42,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777957902] [2019-12-18 14:40:42,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:40:42,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:42,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:40:42,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:40:42,204 INFO L87 Difference]: Start difference. First operand 88607 states and 363903 transitions. Second operand 3 states. [2019-12-18 14:40:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:43,297 INFO L93 Difference]: Finished difference Result 84552 states and 342415 transitions. [2019-12-18 14:40:43,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:40:43,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 14:40:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:43,530 INFO L225 Difference]: With dead ends: 84552 [2019-12-18 14:40:43,530 INFO L226 Difference]: Without dead ends: 84552 [2019-12-18 14:40:43,531 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 14:40:49,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84552 states. [2019-12-18 14:40:50,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84552 to 84552. [2019-12-18 14:40:50,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84552 states. [2019-12-18 14:40:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84552 states to 84552 states and 342415 transitions. [2019-12-18 14:40:51,198 INFO L78 Accepts]: Start accepts. Automaton has 84552 states and 342415 transitions. Word has length 21 [2019-12-18 14:40:51,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:51,198 INFO L462 AbstractCegarLoop]: Abstraction has 84552 states and 342415 transitions. [2019-12-18 14:40:51,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:40:51,199 INFO L276 IsEmpty]: Start isEmpty. Operand 84552 states and 342415 transitions. [2019-12-18 14:40:51,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:40:51,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:51,212 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 14:40:51,212 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:51,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:51,213 INFO L82 PathProgramCache]: Analyzing trace with hash 120078242, now seen corresponding path program 1 times [2019-12-18 14:40:51,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:51,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538825520] [2019-12-18 14:40:51,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:51,293 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 14:40:51,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538825520] [2019-12-18 14:40:51,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:51,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:40:51,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445325099] [2019-12-18 14:40:51,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:40:51,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:51,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:40:51,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:40:51,295 INFO L87 Difference]: Start difference. First operand 84552 states and 342415 transitions. Second operand 6 states. [2019-12-18 14:40:53,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:53,357 INFO L93 Difference]: Finished difference Result 128943 states and 503000 transitions. [2019-12-18 14:40:53,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:40:53,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 14:40:53,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:53,706 INFO L225 Difference]: With dead ends: 128943 [2019-12-18 14:40:53,707 INFO L226 Difference]: Without dead ends: 126131 [2019-12-18 14:40:53,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:41:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126131 states. [2019-12-18 14:41:02,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126131 to 99741. [2019-12-18 14:41:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99741 states. [2019-12-18 14:41:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99741 states to 99741 states and 399345 transitions. [2019-12-18 14:41:02,329 INFO L78 Accepts]: Start accepts. Automaton has 99741 states and 399345 transitions. Word has length 22 [2019-12-18 14:41:02,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:02,330 INFO L462 AbstractCegarLoop]: Abstraction has 99741 states and 399345 transitions. [2019-12-18 14:41:02,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:41:02,330 INFO L276 IsEmpty]: Start isEmpty. Operand 99741 states and 399345 transitions. [2019-12-18 14:41:02,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:41:02,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:02,344 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 14:41:02,344 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:02,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:02,344 INFO L82 PathProgramCache]: Analyzing trace with hash 458918585, now seen corresponding path program 1 times [2019-12-18 14:41:02,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:02,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487726530] [2019-12-18 14:41:02,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:02,408 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 14:41:02,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487726530] [2019-12-18 14:41:02,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:02,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:41:02,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930334298] [2019-12-18 14:41:02,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:41:02,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:02,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:41:02,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:41:02,410 INFO L87 Difference]: Start difference. First operand 99741 states and 399345 transitions. Second operand 6 states. [2019-12-18 14:41:04,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:04,311 INFO L93 Difference]: Finished difference Result 102103 states and 404946 transitions. [2019-12-18 14:41:04,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:41:04,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 14:41:04,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:04,585 INFO L225 Difference]: With dead ends: 102103 [2019-12-18 14:41:04,585 INFO L226 Difference]: Without dead ends: 99113 [2019-12-18 14:41:04,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:41:11,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99113 states. [2019-12-18 14:41:12,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99113 to 98620. [2019-12-18 14:41:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98620 states. [2019-12-18 14:41:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98620 states to 98620 states and 395258 transitions. [2019-12-18 14:41:12,951 INFO L78 Accepts]: Start accepts. Automaton has 98620 states and 395258 transitions. Word has length 22 [2019-12-18 14:41:12,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:12,952 INFO L462 AbstractCegarLoop]: Abstraction has 98620 states and 395258 transitions. [2019-12-18 14:41:12,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:41:12,952 INFO L276 IsEmpty]: Start isEmpty. Operand 98620 states and 395258 transitions. [2019-12-18 14:41:12,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:41:12,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:12,969 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 14:41:12,969 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:12,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:12,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1221135073, now seen corresponding path program 1 times [2019-12-18 14:41:12,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:12,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522834939] [2019-12-18 14:41:12,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:13,042 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 14:41:13,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522834939] [2019-12-18 14:41:13,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:13,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:41:13,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692585558] [2019-12-18 14:41:13,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:41:13,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:13,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:41:13,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:41:13,044 INFO L87 Difference]: Start difference. First operand 98620 states and 395258 transitions. Second operand 4 states. [2019-12-18 14:41:13,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:13,151 INFO L93 Difference]: Finished difference Result 19582 states and 68234 transitions. [2019-12-18 14:41:13,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:41:13,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-18 14:41:13,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:13,177 INFO L225 Difference]: With dead ends: 19582 [2019-12-18 14:41:13,177 INFO L226 Difference]: Without dead ends: 15386 [2019-12-18 14:41:13,178 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 14:41:13,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15386 states. [2019-12-18 14:41:13,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15386 to 15386. [2019-12-18 14:41:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15386 states. [2019-12-18 14:41:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15386 states to 15386 states and 51412 transitions. [2019-12-18 14:41:13,449 INFO L78 Accepts]: Start accepts. Automaton has 15386 states and 51412 transitions. Word has length 22 [2019-12-18 14:41:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:13,449 INFO L462 AbstractCegarLoop]: Abstraction has 15386 states and 51412 transitions. [2019-12-18 14:41:13,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:41:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 15386 states and 51412 transitions. [2019-12-18 14:41:13,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 14:41:13,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:13,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:13,458 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:13,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:13,458 INFO L82 PathProgramCache]: Analyzing trace with hash -966417507, now seen corresponding path program 1 times [2019-12-18 14:41:13,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:13,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745276561] [2019-12-18 14:41:13,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:13,563 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 14:41:13,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745276561] [2019-12-18 14:41:13,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:13,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:41:13,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046459966] [2019-12-18 14:41:13,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:41:13,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:13,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:41:13,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:41:13,565 INFO L87 Difference]: Start difference. First operand 15386 states and 51412 transitions. Second operand 5 states. [2019-12-18 14:41:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:13,636 INFO L93 Difference]: Finished difference Result 6122 states and 19010 transitions. [2019-12-18 14:41:13,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:41:13,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-18 14:41:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:13,649 INFO L225 Difference]: With dead ends: 6122 [2019-12-18 14:41:13,649 INFO L226 Difference]: Without dead ends: 5211 [2019-12-18 14:41:13,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:41:13,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5211 states. [2019-12-18 14:41:13,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5211 to 5211. [2019-12-18 14:41:13,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5211 states. [2019-12-18 14:41:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5211 states to 5211 states and 15988 transitions. [2019-12-18 14:41:14,460 INFO L78 Accepts]: Start accepts. Automaton has 5211 states and 15988 transitions. Word has length 31 [2019-12-18 14:41:14,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:14,460 INFO L462 AbstractCegarLoop]: Abstraction has 5211 states and 15988 transitions. [2019-12-18 14:41:14,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:41:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 5211 states and 15988 transitions. [2019-12-18 14:41:14,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:41:14,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:14,467 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] [2019-12-18 14:41:14,468 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:14,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:14,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1415290960, now seen corresponding path program 1 times [2019-12-18 14:41:14,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:14,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20121052] [2019-12-18 14:41:14,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:14,592 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 14:41:14,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20121052] [2019-12-18 14:41:14,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:14,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:41:14,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795891927] [2019-12-18 14:41:14,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:41:14,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:14,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:41:14,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:41:14,594 INFO L87 Difference]: Start difference. First operand 5211 states and 15988 transitions. Second operand 7 states. [2019-12-18 14:41:14,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:14,943 INFO L93 Difference]: Finished difference Result 5323 states and 16189 transitions. [2019-12-18 14:41:14,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:41:14,943 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-18 14:41:14,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:14,951 INFO L225 Difference]: With dead ends: 5323 [2019-12-18 14:41:14,951 INFO L226 Difference]: Without dead ends: 4755 [2019-12-18 14:41:14,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:41:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2019-12-18 14:41:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 4755. [2019-12-18 14:41:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4755 states. [2019-12-18 14:41:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4755 states to 4755 states and 15072 transitions. [2019-12-18 14:41:15,023 INFO L78 Accepts]: Start accepts. Automaton has 4755 states and 15072 transitions. Word has length 40 [2019-12-18 14:41:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:15,024 INFO L462 AbstractCegarLoop]: Abstraction has 4755 states and 15072 transitions. [2019-12-18 14:41:15,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:41:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 4755 states and 15072 transitions. [2019-12-18 14:41:15,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:41:15,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:15,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:15,029 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:15,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:15,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1495792125, now seen corresponding path program 1 times [2019-12-18 14:41:15,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:15,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733291146] [2019-12-18 14:41:15,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:15,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733291146] [2019-12-18 14:41:15,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:15,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:41:15,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090513113] [2019-12-18 14:41:15,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:41:15,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:15,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:41:15,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:41:15,101 INFO L87 Difference]: Start difference. First operand 4755 states and 15072 transitions. Second operand 5 states. [2019-12-18 14:41:15,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:15,621 INFO L93 Difference]: Finished difference Result 8693 states and 26658 transitions. [2019-12-18 14:41:15,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:41:15,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 14:41:15,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:15,641 INFO L225 Difference]: With dead ends: 8693 [2019-12-18 14:41:15,642 INFO L226 Difference]: Without dead ends: 8693 [2019-12-18 14:41:15,644 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 14:41:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8693 states. [2019-12-18 14:41:15,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8693 to 7254. [2019-12-18 14:41:15,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7254 states. [2019-12-18 14:41:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7254 states to 7254 states and 22626 transitions. [2019-12-18 14:41:15,819 INFO L78 Accepts]: Start accepts. Automaton has 7254 states and 22626 transitions. Word has length 41 [2019-12-18 14:41:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:15,820 INFO L462 AbstractCegarLoop]: Abstraction has 7254 states and 22626 transitions. [2019-12-18 14:41:15,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:41:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 7254 states and 22626 transitions. [2019-12-18 14:41:15,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:41:15,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:15,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:15,831 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:15,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:15,831 INFO L82 PathProgramCache]: Analyzing trace with hash 860786557, now seen corresponding path program 2 times [2019-12-18 14:41:15,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:15,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870239992] [2019-12-18 14:41:15,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:15,904 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 14:41:15,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870239992] [2019-12-18 14:41:15,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:15,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:41:15,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870501463] [2019-12-18 14:41:15,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:41:15,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:15,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:41:15,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:41:15,906 INFO L87 Difference]: Start difference. First operand 7254 states and 22626 transitions. Second operand 3 states. [2019-12-18 14:41:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:15,945 INFO L93 Difference]: Finished difference Result 6756 states and 20623 transitions. [2019-12-18 14:41:15,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:41:15,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 14:41:15,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:15,958 INFO L225 Difference]: With dead ends: 6756 [2019-12-18 14:41:15,958 INFO L226 Difference]: Without dead ends: 6756 [2019-12-18 14:41:15,959 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 14:41:16,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6756 states. [2019-12-18 14:41:16,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6756 to 6680. [2019-12-18 14:41:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6680 states. [2019-12-18 14:41:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6680 states to 6680 states and 20406 transitions. [2019-12-18 14:41:16,104 INFO L78 Accepts]: Start accepts. Automaton has 6680 states and 20406 transitions. Word has length 41 [2019-12-18 14:41:16,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:16,104 INFO L462 AbstractCegarLoop]: Abstraction has 6680 states and 20406 transitions. [2019-12-18 14:41:16,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:41:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand 6680 states and 20406 transitions. [2019-12-18 14:41:16,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 14:41:16,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:16,111 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:16,111 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:16,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:16,111 INFO L82 PathProgramCache]: Analyzing trace with hash -598466109, now seen corresponding path program 1 times [2019-12-18 14:41:16,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:16,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909074214] [2019-12-18 14:41:16,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:16,230 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 14:41:16,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909074214] [2019-12-18 14:41:16,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:16,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:41:16,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260545913] [2019-12-18 14:41:16,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:41:16,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:16,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:41:16,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:41:16,233 INFO L87 Difference]: Start difference. First operand 6680 states and 20406 transitions. Second operand 6 states. [2019-12-18 14:41:16,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:16,318 INFO L93 Difference]: Finished difference Result 5870 states and 18393 transitions. [2019-12-18 14:41:16,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:41:16,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 14:41:16,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:16,328 INFO L225 Difference]: With dead ends: 5870 [2019-12-18 14:41:16,328 INFO L226 Difference]: Without dead ends: 5782 [2019-12-18 14:41:16,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:41:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5782 states. [2019-12-18 14:41:16,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5782 to 5782. [2019-12-18 14:41:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5782 states. [2019-12-18 14:41:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5782 states to 5782 states and 18185 transitions. [2019-12-18 14:41:16,415 INFO L78 Accepts]: Start accepts. Automaton has 5782 states and 18185 transitions. Word has length 42 [2019-12-18 14:41:16,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:16,415 INFO L462 AbstractCegarLoop]: Abstraction has 5782 states and 18185 transitions. [2019-12-18 14:41:16,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:41:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 5782 states and 18185 transitions. [2019-12-18 14:41:16,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:41:16,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:16,422 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 14:41:16,422 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:16,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:16,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1916857338, now seen corresponding path program 1 times [2019-12-18 14:41:16,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:16,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784510390] [2019-12-18 14:41:16,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:16,462 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 14:41:16,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784510390] [2019-12-18 14:41:16,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:16,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:41:16,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331741762] [2019-12-18 14:41:16,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:41:16,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:16,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:41:16,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:41:16,464 INFO L87 Difference]: Start difference. First operand 5782 states and 18185 transitions. Second operand 3 states. [2019-12-18 14:41:16,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:16,524 INFO L93 Difference]: Finished difference Result 7834 states and 24076 transitions. [2019-12-18 14:41:16,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:41:16,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 14:41:16,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:16,537 INFO L225 Difference]: With dead ends: 7834 [2019-12-18 14:41:16,538 INFO L226 Difference]: Without dead ends: 7834 [2019-12-18 14:41:16,538 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 14:41:16,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7834 states. [2019-12-18 14:41:16,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7834 to 6424. [2019-12-18 14:41:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6424 states. [2019-12-18 14:41:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6424 states to 6424 states and 20079 transitions. [2019-12-18 14:41:16,642 INFO L78 Accepts]: Start accepts. Automaton has 6424 states and 20079 transitions. Word has length 56 [2019-12-18 14:41:16,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:16,642 INFO L462 AbstractCegarLoop]: Abstraction has 6424 states and 20079 transitions. [2019-12-18 14:41:16,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:41:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 6424 states and 20079 transitions. [2019-12-18 14:41:16,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:41:16,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:16,650 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 14:41:16,650 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:16,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:16,651 INFO L82 PathProgramCache]: Analyzing trace with hash -261820410, now seen corresponding path program 1 times [2019-12-18 14:41:16,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:16,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695238421] [2019-12-18 14:41:16,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:16,833 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 14:41:16,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695238421] [2019-12-18 14:41:16,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:16,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:41:16,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573497816] [2019-12-18 14:41:16,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:41:16,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:16,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:41:16,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:41:16,836 INFO L87 Difference]: Start difference. First operand 6424 states and 20079 transitions. Second operand 11 states. [2019-12-18 14:41:18,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:18,237 INFO L93 Difference]: Finished difference Result 12608 states and 38572 transitions. [2019-12-18 14:41:18,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 14:41:18,237 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 14:41:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:18,252 INFO L225 Difference]: With dead ends: 12608 [2019-12-18 14:41:18,252 INFO L226 Difference]: Without dead ends: 8510 [2019-12-18 14:41:18,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=856, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 14:41:18,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8510 states. [2019-12-18 14:41:18,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8510 to 7624. [2019-12-18 14:41:18,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7624 states. [2019-12-18 14:41:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7624 states to 7624 states and 23146 transitions. [2019-12-18 14:41:18,381 INFO L78 Accepts]: Start accepts. Automaton has 7624 states and 23146 transitions. Word has length 56 [2019-12-18 14:41:18,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:18,382 INFO L462 AbstractCegarLoop]: Abstraction has 7624 states and 23146 transitions. [2019-12-18 14:41:18,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:41:18,382 INFO L276 IsEmpty]: Start isEmpty. Operand 7624 states and 23146 transitions. [2019-12-18 14:41:18,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:41:18,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:18,390 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 14:41:18,390 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:18,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:18,390 INFO L82 PathProgramCache]: Analyzing trace with hash -899860532, now seen corresponding path program 2 times [2019-12-18 14:41:18,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:18,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869095300] [2019-12-18 14:41:18,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:18,602 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 14:41:18,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869095300] [2019-12-18 14:41:18,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:18,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:41:18,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067671751] [2019-12-18 14:41:18,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:41:18,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:18,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:41:18,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:41:18,603 INFO L87 Difference]: Start difference. First operand 7624 states and 23146 transitions. Second operand 12 states. [2019-12-18 14:41:19,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:19,396 INFO L93 Difference]: Finished difference Result 8892 states and 26288 transitions. [2019-12-18 14:41:19,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 14:41:19,397 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 14:41:19,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:19,409 INFO L225 Difference]: With dead ends: 8892 [2019-12-18 14:41:19,410 INFO L226 Difference]: Without dead ends: 8178 [2019-12-18 14:41:19,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2019-12-18 14:41:19,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8178 states. [2019-12-18 14:41:19,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8178 to 7436. [2019-12-18 14:41:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7436 states. [2019-12-18 14:41:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7436 states to 7436 states and 22603 transitions. [2019-12-18 14:41:19,524 INFO L78 Accepts]: Start accepts. Automaton has 7436 states and 22603 transitions. Word has length 56 [2019-12-18 14:41:19,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:19,524 INFO L462 AbstractCegarLoop]: Abstraction has 7436 states and 22603 transitions. [2019-12-18 14:41:19,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:41:19,524 INFO L276 IsEmpty]: Start isEmpty. Operand 7436 states and 22603 transitions. [2019-12-18 14:41:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:41:19,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:19,536 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 14:41:19,536 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:19,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:19,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1827744688, now seen corresponding path program 3 times [2019-12-18 14:41:19,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:19,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750495341] [2019-12-18 14:41:19,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:41:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:41:19,636 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:41:19,636 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:41:19,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~x$r_buff1_thd1~0_405 0) (= v_~z~0_42 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2058~0.base_25|) 0) (= v_~y~0_203 0) (= 0 v_~x$w_buff1~0_314) (= 0 v_~x$r_buff0_thd3~0_141) (= v_~x$flush_delayed~0_58 0) (= v_~__unbuffered_p0_EBX~0_60 0) (= v_~x$mem_tmp~0_35 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2058~0.base_25| 4)) (= 0 v_~__unbuffered_p2_EAX~0_39) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$w_buff0_used~0_913) (= v_~x$r_buff0_thd0~0_157 0) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$w_buff1_used~0_606) (= 0 v_~weak$$choice0~0_33) (= 0 v_~x$r_buff0_thd2~0_302) (= 0 v_~x$r_buff1_thd2~0_251) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2058~0.base_25|) (= v_~x$r_buff1_thd0~0_275 0) (= 0 v_~x$w_buff0~0_388) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2058~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2058~0.base_25|) |v_ULTIMATE.start_main_~#t2058~0.offset_19| 0)) |v_#memory_int_23|) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_254) (= |v_ULTIMATE.start_main_~#t2058~0.offset_19| 0) (= v_~main$tmp_guard0~0_48 0) (= 0 v_~x~0_230) (= v_~weak$$choice2~0_176 0) (= v_~x$r_buff0_thd1~0_365 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t2058~0.base_25| 1)) (= 0 v_~__unbuffered_p0_EAX~0_54))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_388, ~x$flush_delayed~0=v_~x$flush_delayed~0_58, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_405, ULTIMATE.start_main_~#t2059~0.offset=|v_ULTIMATE.start_main_~#t2059~0.offset_19|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_141, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_157, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_606, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_251, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_33, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_230, ULTIMATE.start_main_~#t2058~0.base=|v_ULTIMATE.start_main_~#t2058~0.base_25|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_365, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_71|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_35, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_59|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2058~0.offset=|v_ULTIMATE.start_main_~#t2058~0.offset_19|, ~y~0=v_~y~0_203, ULTIMATE.start_main_~#t2060~0.offset=|v_ULTIMATE.start_main_~#t2060~0.offset_14|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_21|, ULTIMATE.start_main_~#t2059~0.base=|v_ULTIMATE.start_main_~#t2059~0.base_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_48, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_275, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_302, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_~#t2060~0.base=|v_ULTIMATE.start_main_~#t2060~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_42, ~weak$$choice2~0=v_~weak$$choice2~0_176, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ULTIMATE.start_main_~#t2059~0.offset, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p0_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_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2058~0.base, ~x$r_buff0_thd1~0, 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, ULTIMATE.start_main_~#t2058~0.offset, ~y~0, ULTIMATE.start_main_~#t2060~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2059~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t2060~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, 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 14:41:19,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L818-1-->L820: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2059~0.base_10| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2059~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t2059~0.base_10|)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2059~0.base_10|) 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2059~0.base_10| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2059~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2059~0.base_10|) |v_ULTIMATE.start_main_~#t2059~0.offset_9| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t2059~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t2059~0.base=|v_ULTIMATE.start_main_~#t2059~0.base_10|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2059~0.offset=|v_ULTIMATE.start_main_~#t2059~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2059~0.base, #length, ULTIMATE.start_main_~#t2059~0.offset] because there is no mapped edge [2019-12-18 14:41:19,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L820-1-->L822: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2060~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2060~0.base_11|) |v_ULTIMATE.start_main_~#t2060~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t2060~0.base_11| 0)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2060~0.base_11| 4) |v_#length_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2060~0.base_11|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2060~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2060~0.offset_10|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2060~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2060~0.base=|v_ULTIMATE.start_main_~#t2060~0.base_11|, ULTIMATE.start_main_~#t2060~0.offset=|v_ULTIMATE.start_main_~#t2060~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2060~0.base, ULTIMATE.start_main_~#t2060~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 14:41:19,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff1_used~0_56 v_~x$w_buff0_used~0_106) (= v_P1Thread1of1ForFork0_~arg.offset_7 |v_P1Thread1of1ForFork0_#in~arg.offset_7|) (= v_P1Thread1of1ForFork0_~arg.base_7 |v_P1Thread1of1ForFork0_#in~arg.base_7|) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_15) (= 1 v_~x$w_buff0_used~0_105) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= 0 (mod v_~x$w_buff1_used~0_56 256)) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_7, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_7, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 14:41:19,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In708642173 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In708642173 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In708642173 |P2Thread1of1ForFork1_#t~ite32_Out708642173|) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In708642173 |P2Thread1of1ForFork1_#t~ite32_Out708642173|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In708642173, ~x$w_buff1_used~0=~x$w_buff1_used~0_In708642173, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In708642173, ~x~0=~x~0_In708642173} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out708642173|, ~x$w_buff1~0=~x$w_buff1~0_In708642173, ~x$w_buff1_used~0=~x$w_buff1_used~0_In708642173, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In708642173, ~x~0=~x~0_In708642173} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 14:41:19,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_10|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_10|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 14:41:19,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In1721379752 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1721379752 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1721379752 |P2Thread1of1ForFork1_#t~ite34_Out1721379752|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1721379752|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1721379752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1721379752} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1721379752|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1721379752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1721379752} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 14:41:19,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-261787939 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-261787939 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-261787939| ~x$w_buff0_used~0_In-261787939)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-261787939| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-261787939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-261787939} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-261787939, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-261787939|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-261787939} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 14:41:19,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In473345436 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In473345436 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In473345436 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In473345436 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out473345436|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In473345436 |P1Thread1of1ForFork0_#t~ite29_Out473345436|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In473345436, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In473345436, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In473345436, ~x$w_buff0_used~0=~x$w_buff0_used~0_In473345436} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In473345436, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In473345436, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In473345436, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out473345436|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In473345436} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 14:41:19,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L740-->L740-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In220173756 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In220173756 256)))) (or (and (= (mod ~x$r_buff1_thd1~0_In220173756 256) 0) .cse0) (= (mod ~x$w_buff0_used~0_In220173756 256) 0) (and (= (mod ~x$w_buff1_used~0_In220173756 256) 0) .cse0))) .cse1 (= ~x$w_buff0~0_In220173756 |P0Thread1of1ForFork2_#t~ite8_Out220173756|) (= |P0Thread1of1ForFork2_#t~ite9_Out220173756| |P0Thread1of1ForFork2_#t~ite8_Out220173756|)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite8_In220173756| |P0Thread1of1ForFork2_#t~ite8_Out220173756|) (= ~x$w_buff0~0_In220173756 |P0Thread1of1ForFork2_#t~ite9_Out220173756|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In220173756, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In220173756, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In220173756|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In220173756, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In220173756, ~weak$$choice2~0=~weak$$choice2~0_In220173756, ~x$w_buff0_used~0=~x$w_buff0_used~0_In220173756} OutVars{~x$w_buff0~0=~x$w_buff0~0_In220173756, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In220173756, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out220173756|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In220173756, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out220173756|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In220173756, ~weak$$choice2~0=~weak$$choice2~0_In220173756, ~x$w_buff0_used~0=~x$w_buff0_used~0_In220173756} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 14:41:19,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In809425241 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite15_Out809425241| |P0Thread1of1ForFork2_#t~ite14_Out809425241|) (= |P0Thread1of1ForFork2_#t~ite14_Out809425241| ~x$w_buff0_used~0_In809425241) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In809425241 256)))) (or (and (= (mod ~x$r_buff1_thd1~0_In809425241 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In809425241 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In809425241 256)) .cse1)))) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In809425241| |P0Thread1of1ForFork2_#t~ite14_Out809425241|) (= |P0Thread1of1ForFork2_#t~ite15_Out809425241| ~x$w_buff0_used~0_In809425241)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In809425241, ~x$w_buff1_used~0=~x$w_buff1_used~0_In809425241, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In809425241, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In809425241|, ~weak$$choice2~0=~weak$$choice2~0_In809425241, ~x$w_buff0_used~0=~x$w_buff0_used~0_In809425241} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In809425241, ~x$w_buff1_used~0=~x$w_buff1_used~0_In809425241, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out809425241|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In809425241, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out809425241|, ~weak$$choice2~0=~weak$$choice2~0_In809425241, ~x$w_buff0_used~0=~x$w_buff0_used~0_In809425241} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 14:41:19,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2137389928 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_In-2137389928| |P0Thread1of1ForFork2_#t~ite17_Out-2137389928|) (= ~x$w_buff1_used~0_In-2137389928 |P0Thread1of1ForFork2_#t~ite18_Out-2137389928|) (not .cse0)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-2137389928 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-2137389928 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-2137389928 256))) (= 0 (mod ~x$w_buff0_used~0_In-2137389928 256)))) .cse0 (= |P0Thread1of1ForFork2_#t~ite17_Out-2137389928| |P0Thread1of1ForFork2_#t~ite18_Out-2137389928|) (= |P0Thread1of1ForFork2_#t~ite17_Out-2137389928| ~x$w_buff1_used~0_In-2137389928)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2137389928, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-2137389928|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2137389928, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2137389928, ~weak$$choice2~0=~weak$$choice2~0_In-2137389928, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2137389928} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2137389928, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-2137389928|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-2137389928|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2137389928, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2137389928, ~weak$$choice2~0=~weak$$choice2~0_In-2137389928, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2137389928} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 14:41:19,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_112 v_~x$r_buff0_thd1~0_111) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_111, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_17|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 14:41:19,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In280620749 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In280620749 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In280620749 256)) .cse0) (= (mod ~x$w_buff0_used~0_In280620749 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In280620749 256)) .cse0))) .cse1 (= |P0Thread1of1ForFork2_#t~ite24_Out280620749| |P0Thread1of1ForFork2_#t~ite23_Out280620749|) (= ~x$r_buff1_thd1~0_In280620749 |P0Thread1of1ForFork2_#t~ite23_Out280620749|)) (and (= ~x$r_buff1_thd1~0_In280620749 |P0Thread1of1ForFork2_#t~ite24_Out280620749|) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite23_In280620749| |P0Thread1of1ForFork2_#t~ite23_Out280620749|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In280620749, ~x$w_buff1_used~0=~x$w_buff1_used~0_In280620749, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In280620749, ~weak$$choice2~0=~weak$$choice2~0_In280620749, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In280620749|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In280620749} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In280620749, ~x$w_buff1_used~0=~x$w_buff1_used~0_In280620749, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In280620749, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out280620749|, ~weak$$choice2~0=~weak$$choice2~0_In280620749, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out280620749|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In280620749} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 14:41:19,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-806851922 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-806851922 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-806851922 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-806851922 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-806851922|)) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-806851922 |P2Thread1of1ForFork1_#t~ite35_Out-806851922|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-806851922, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-806851922, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-806851922, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-806851922} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-806851922|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-806851922, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-806851922, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-806851922, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-806851922} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 14:41:19,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1572351533 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1572351533 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-1572351533|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-1572351533 |P2Thread1of1ForFork1_#t~ite36_Out-1572351533|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1572351533, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1572351533} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1572351533|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1572351533, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1572351533} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 14:41:19,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-783008186 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-783008186 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-783008186 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-783008186 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-783008186|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out-783008186| ~x$r_buff1_thd3~0_In-783008186) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-783008186, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-783008186, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-783008186, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-783008186} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-783008186|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-783008186, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-783008186, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-783008186, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-783008186} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:41:19,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_52 |v_P2Thread1of1ForFork1_#t~ite37_30|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_53 1) v_~__unbuffered_cnt~0_52)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 14:41:19,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L778-->L779: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1538909125 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1538909125 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out1538909125)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In1538909125 ~x$r_buff0_thd2~0_Out1538909125)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1538909125, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1538909125} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1538909125|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1538909125, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1538909125} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:41:19,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In651145648 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In651145648 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In651145648 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In651145648 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out651145648|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$r_buff1_thd2~0_In651145648 |P1Thread1of1ForFork0_#t~ite31_Out651145648|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In651145648, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In651145648, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In651145648, ~x$w_buff0_used~0=~x$w_buff0_used~0_In651145648} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out651145648|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In651145648, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In651145648, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In651145648, ~x$w_buff0_used~0=~x$w_buff0_used~0_In651145648} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 14:41:19,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_50, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 14:41:19,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 14:41:19,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L826-->L828-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~x$r_buff0_thd0~0_27 256) 0) (= (mod v_~x$w_buff0_used~0_180 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:41:19,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In504161226 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In504161226 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out504161226| ~x$w_buff1~0_In504161226)) (and (or .cse0 .cse1) (= ~x~0_In504161226 |ULTIMATE.start_main_#t~ite41_Out504161226|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In504161226, ~x$w_buff1_used~0=~x$w_buff1_used~0_In504161226, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In504161226, ~x~0=~x~0_In504161226} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out504161226|, ~x$w_buff1~0=~x$w_buff1~0_In504161226, ~x$w_buff1_used~0=~x$w_buff1_used~0_In504161226, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In504161226, ~x~0=~x~0_In504161226} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 14:41:19,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L828-4-->L829: Formula: (= v_~x~0_26 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|, ~x~0=v_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 14:41:19,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In351508443 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In351508443 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out351508443| ~x$w_buff0_used~0_In351508443) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out351508443| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In351508443, ~x$w_buff0_used~0=~x$w_buff0_used~0_In351508443} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In351508443, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out351508443|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In351508443} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 14:41:19,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In1573285783 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1573285783 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1573285783 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1573285783 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1573285783|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1573285783 |ULTIMATE.start_main_#t~ite44_Out1573285783|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1573285783, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1573285783, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1573285783, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1573285783} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1573285783, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1573285783, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1573285783, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1573285783|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1573285783} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 14:41:19,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In753042193 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In753042193 256)))) (or (and (= ~x$r_buff0_thd0~0_In753042193 |ULTIMATE.start_main_#t~ite45_Out753042193|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out753042193|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In753042193, ~x$w_buff0_used~0=~x$w_buff0_used~0_In753042193} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In753042193, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out753042193|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In753042193} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 14:41:19,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In1669559391 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1669559391 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1669559391 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1669559391 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out1669559391| 0)) (and (= |ULTIMATE.start_main_#t~ite46_Out1669559391| ~x$r_buff1_thd0~0_In1669559391) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1669559391, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1669559391, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1669559391, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1669559391} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1669559391, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1669559391|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1669559391, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1669559391, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1669559391} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 14:41:19,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p0_EBX~0_48 0) (= 1 v_~__unbuffered_p2_EAX~0_27) (= v_~x$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite46_48|) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 1 v_~__unbuffered_p0_EAX~0_42) (= v_~main$tmp_guard1~0_23 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_255, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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 14:41:19,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:41:19 BasicIcfg [2019-12-18 14:41:19,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:41:19,735 INFO L168 Benchmark]: Toolchain (without parser) took 160106.52 ms. Allocated memory was 141.0 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 103.0 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 14:41:19,736 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 141.0 MB. Free memory is still 122.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 14:41:19,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.72 ms. Allocated memory was 141.0 MB in the beginning and 202.4 MB in the end (delta: 61.3 MB). Free memory was 102.6 MB in the beginning and 156.4 MB in the end (delta: -53.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:41:19,737 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.30 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 153.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:41:19,737 INFO L168 Benchmark]: Boogie Preprocessor took 47.91 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 151.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:41:19,738 INFO L168 Benchmark]: RCFGBuilder took 801.09 ms. Allocated memory is still 202.4 MB. Free memory was 151.4 MB in the beginning and 104.8 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:41:19,739 INFO L168 Benchmark]: TraceAbstraction took 158392.92 ms. Allocated memory was 202.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 104.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 14:41:19,741 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 141.0 MB. Free memory is still 122.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.72 ms. Allocated memory was 141.0 MB in the beginning and 202.4 MB in the end (delta: 61.3 MB). Free memory was 102.6 MB in the beginning and 156.4 MB in the end (delta: -53.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.30 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 153.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.91 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 151.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 801.09 ms. Allocated memory is still 202.4 MB. Free memory was 151.4 MB in the beginning and 104.8 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 158392.92 ms. Allocated memory was 202.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 104.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 164 ProgramPointsBefore, 81 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 27 ChoiceCompositions, 6883 VarBasedMoverChecksPositive, 281 VarBasedMoverChecksNegative, 110 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 64821 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2058, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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] [L820] FCALL, FORK 0 pthread_create(&t2059, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=0] [L775] 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_p0_EBX=0, __unbuffered_p2_EAX=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=0] [L822] FCALL, FORK 0 pthread_create(&t2060, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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] [L795] 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_p0_EBX=0, __unbuffered_p2_EAX=1, 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] [L775] 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) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L732] 1 __unbuffered_p0_EAX = z [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 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 [L739] 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) [L740] 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)) [L741] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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 : (!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))=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_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 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)) [L742] 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)) [L743] 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)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L745] 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)) [L746] 1 __unbuffered_p0_EBX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 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 [L831] 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, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 158.0s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 44.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2711 SDtfs, 4192 SDslu, 6927 SDs, 0 SdLazy, 3387 SolverSat, 190 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 21 SyntacticMatches, 12 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137168occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 94.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 151282 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 627 NumberOfCodeBlocks, 627 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 551 ConstructedInterpolants, 0 QuantifiedInterpolants, 63639 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...