/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:01:37,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:01:37,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:01:37,392 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:01:37,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:01:37,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:01:37,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:01:37,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:01:37,401 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:01:37,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:01:37,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:01:37,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:01:37,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:01:37,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:01:37,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:01:37,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:01:37,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:01:37,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:01:37,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:01:37,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:01:37,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:01:37,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:01:37,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:01:37,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:01:37,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:01:37,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:01:37,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:01:37,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:01:37,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:01:37,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:01:37,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:01:37,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:01:37,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:01:37,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:01:37,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:01:37,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:01:37,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:01:37,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:01:37,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:01:37,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:01:37,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:01:37,440 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:01:37,460 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:01:37,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:01:37,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:01:37,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:01:37,463 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:01:37,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:01:37,463 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:01:37,464 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:01:37,464 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:01:37,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:01:37,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:01:37,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:01:37,466 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:01:37,466 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:01:37,466 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:01:37,466 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:01:37,467 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:01:37,467 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:01:37,467 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:01:37,467 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:01:37,467 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:01:37,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:01:37,468 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:01:37,468 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:01:37,468 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:01:37,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:01:37,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:01:37,469 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:01:37,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:01:37,469 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:01:37,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:01:37,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:01:37,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:01:37,758 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:01:37,759 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:01:37,760 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:01:37,761 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt.i [2019-12-27 16:01:37,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c074a8cb1/33a1a7d9652b475489f54df4adabb5de/FLAGaeeda1c77 [2019-12-27 16:01:38,395 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:01:38,395 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_power.opt.i [2019-12-27 16:01:38,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c074a8cb1/33a1a7d9652b475489f54df4adabb5de/FLAGaeeda1c77 [2019-12-27 16:01:38,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c074a8cb1/33a1a7d9652b475489f54df4adabb5de [2019-12-27 16:01:38,673 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:01:38,675 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:01:38,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:01:38,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:01:38,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:01:38,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:01:38" (1/1) ... [2019-12-27 16:01:38,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e22d9d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:38, skipping insertion in model container [2019-12-27 16:01:38,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:01:38" (1/1) ... [2019-12-27 16:01:38,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:01:38,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:01:39,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:01:39,272 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:01:39,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:01:39,433 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:01:39,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:39 WrapperNode [2019-12-27 16:01:39,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:01:39,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:01:39,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:01:39,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:01:39,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:39" (1/1) ... [2019-12-27 16:01:39,470 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:39" (1/1) ... [2019-12-27 16:01:39,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:01:39,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:01:39,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:01:39,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:01:39,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:39" (1/1) ... [2019-12-27 16:01:39,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:39" (1/1) ... [2019-12-27 16:01:39,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:39" (1/1) ... [2019-12-27 16:01:39,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:39" (1/1) ... [2019-12-27 16:01:39,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:39" (1/1) ... [2019-12-27 16:01:39,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:39" (1/1) ... [2019-12-27 16:01:39,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:39" (1/1) ... [2019-12-27 16:01:39,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:01:39,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:01:39,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:01:39,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:01:39,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:01:39,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:01:39,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:01:39,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:01:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:01:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:01:39,616 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:01:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:01:39,616 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:01:39,617 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:01:39,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:01:39,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:01:39,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:01:39,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:01:39,619 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:01:40,380 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:01:40,381 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:01:40,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:01:40 BoogieIcfgContainer [2019-12-27 16:01:40,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:01:40,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:01:40,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:01:40,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:01:40,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:01:38" (1/3) ... [2019-12-27 16:01:40,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b96b37e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:01:40, skipping insertion in model container [2019-12-27 16:01:40,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:39" (2/3) ... [2019-12-27 16:01:40,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b96b37e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:01:40, skipping insertion in model container [2019-12-27 16:01:40,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:01:40" (3/3) ... [2019-12-27 16:01:40,392 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_power.opt.i [2019-12-27 16:01:40,403 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:01:40,404 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:01:40,412 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:01:40,414 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:01:40,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,458 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,482 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,483 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,483 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,483 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,513 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,520 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,520 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,529 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,529 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,529 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,535 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,535 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,538 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,539 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,559 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:01:40,581 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:01:40,581 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:01:40,581 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:01:40,582 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:01:40,582 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:01:40,582 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:01:40,582 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:01:40,582 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:01:40,602 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-27 16:01:40,604 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 16:01:40,748 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 16:01:40,749 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:01:40,765 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 16:01:40,787 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 16:01:40,860 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 16:01:40,860 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:01:40,868 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 16:01:40,888 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 16:01:40,889 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:01:46,193 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 16:01:46,345 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 16:01:46,378 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75392 [2019-12-27 16:01:46,379 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 16:01:46,382 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 91 transitions [2019-12-27 16:01:57,470 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86190 states. [2019-12-27 16:01:57,473 INFO L276 IsEmpty]: Start isEmpty. Operand 86190 states. [2019-12-27 16:01:57,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 16:01:57,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:57,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 16:01:57,481 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-27 16:01:57,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:57,486 INFO L82 PathProgramCache]: Analyzing trace with hash 802149997, now seen corresponding path program 1 times [2019-12-27 16:01:57,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:57,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141162115] [2019-12-27 16:01:57,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:01:57,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141162115] [2019-12-27 16:01:57,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:57,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:01:57,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1603159785] [2019-12-27 16:01:57,733 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:57,737 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:57,748 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 16:01:57,749 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:57,752 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:01:57,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:01:57,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:57,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:01:57,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:01:57,768 INFO L87 Difference]: Start difference. First operand 86190 states. Second operand 3 states. [2019-12-27 16:02:00,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:00,637 INFO L93 Difference]: Finished difference Result 85100 states and 365324 transitions. [2019-12-27 16:02:00,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:00,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 16:02:00,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:01,221 INFO L225 Difference]: With dead ends: 85100 [2019-12-27 16:02:01,221 INFO L226 Difference]: Without dead ends: 79822 [2019-12-27 16:02:01,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:04,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79822 states. [2019-12-27 16:02:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79822 to 79822. [2019-12-27 16:02:08,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79822 states. [2019-12-27 16:02:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79822 states to 79822 states and 342168 transitions. [2019-12-27 16:02:08,786 INFO L78 Accepts]: Start accepts. Automaton has 79822 states and 342168 transitions. Word has length 5 [2019-12-27 16:02:08,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:08,787 INFO L462 AbstractCegarLoop]: Abstraction has 79822 states and 342168 transitions. [2019-12-27 16:02:08,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:02:08,787 INFO L276 IsEmpty]: Start isEmpty. Operand 79822 states and 342168 transitions. [2019-12-27 16:02:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:02:08,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:08,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:08,801 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-27 16:02:08,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:08,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1460490103, now seen corresponding path program 1 times [2019-12-27 16:02:08,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:08,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43754544] [2019-12-27 16:02:08,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:08,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43754544] [2019-12-27 16:02:08,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:08,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:02:08,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1515778866] [2019-12-27 16:02:08,941 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:08,942 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:08,947 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:02:08,947 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:08,947 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:08,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:02:08,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:08,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:02:08,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:08,950 INFO L87 Difference]: Start difference. First operand 79822 states and 342168 transitions. Second operand 3 states. [2019-12-27 16:02:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:11,921 INFO L93 Difference]: Finished difference Result 21012 states and 72403 transitions. [2019-12-27 16:02:11,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:11,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:02:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:11,982 INFO L225 Difference]: With dead ends: 21012 [2019-12-27 16:02:11,982 INFO L226 Difference]: Without dead ends: 21012 [2019-12-27 16:02:11,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:12,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21012 states. [2019-12-27 16:02:12,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21012 to 21012. [2019-12-27 16:02:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21012 states. [2019-12-27 16:02:12,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21012 states to 21012 states and 72403 transitions. [2019-12-27 16:02:12,492 INFO L78 Accepts]: Start accepts. Automaton has 21012 states and 72403 transitions. Word has length 13 [2019-12-27 16:02:12,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:12,493 INFO L462 AbstractCegarLoop]: Abstraction has 21012 states and 72403 transitions. [2019-12-27 16:02:12,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:02:12,493 INFO L276 IsEmpty]: Start isEmpty. Operand 21012 states and 72403 transitions. [2019-12-27 16:02:12,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:02:12,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:12,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:12,495 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-27 16:02:12,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:12,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1843446667, now seen corresponding path program 1 times [2019-12-27 16:02:12,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:12,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182310425] [2019-12-27 16:02:12,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:12,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182310425] [2019-12-27 16:02:12,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:12,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:02:12,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [413844663] [2019-12-27 16:02:12,590 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:12,592 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:12,593 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:02:12,594 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:12,594 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:12,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:02:12,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:12,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:02:12,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:02:12,595 INFO L87 Difference]: Start difference. First operand 21012 states and 72403 transitions. Second operand 4 states. [2019-12-27 16:02:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:12,952 INFO L93 Difference]: Finished difference Result 31168 states and 104167 transitions. [2019-12-27 16:02:12,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:02:12,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 16:02:12,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:13,080 INFO L225 Difference]: With dead ends: 31168 [2019-12-27 16:02:13,081 INFO L226 Difference]: Without dead ends: 31154 [2019-12-27 16:02:13,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:13,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31154 states. [2019-12-27 16:02:14,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31154 to 27751. [2019-12-27 16:02:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27751 states. [2019-12-27 16:02:14,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27751 states to 27751 states and 93636 transitions. [2019-12-27 16:02:14,106 INFO L78 Accepts]: Start accepts. Automaton has 27751 states and 93636 transitions. Word has length 13 [2019-12-27 16:02:14,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:14,108 INFO L462 AbstractCegarLoop]: Abstraction has 27751 states and 93636 transitions. [2019-12-27 16:02:14,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:02:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 27751 states and 93636 transitions. [2019-12-27 16:02:14,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:02:14,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:14,111 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:14,111 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-27 16:02:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:14,112 INFO L82 PathProgramCache]: Analyzing trace with hash 890356816, now seen corresponding path program 1 times [2019-12-27 16:02:14,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:14,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382431104] [2019-12-27 16:02:14,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:14,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:14,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382431104] [2019-12-27 16:02:14,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:14,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:14,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2107535877] [2019-12-27 16:02:14,186 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:14,188 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:14,191 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 16:02:14,191 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:14,273 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:02:14,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:02:14,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:14,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:02:14,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:02:14,278 INFO L87 Difference]: Start difference. First operand 27751 states and 93636 transitions. Second operand 7 states. [2019-12-27 16:02:14,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:14,891 INFO L93 Difference]: Finished difference Result 40618 states and 134851 transitions. [2019-12-27 16:02:14,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:02:14,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-27 16:02:14,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:15,037 INFO L225 Difference]: With dead ends: 40618 [2019-12-27 16:02:15,038 INFO L226 Difference]: Without dead ends: 40602 [2019-12-27 16:02:15,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:02:15,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40602 states. [2019-12-27 16:02:15,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40602 to 32075. [2019-12-27 16:02:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32075 states. [2019-12-27 16:02:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32075 states to 32075 states and 107493 transitions. [2019-12-27 16:02:16,258 INFO L78 Accepts]: Start accepts. Automaton has 32075 states and 107493 transitions. Word has length 14 [2019-12-27 16:02:16,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:16,259 INFO L462 AbstractCegarLoop]: Abstraction has 32075 states and 107493 transitions. [2019-12-27 16:02:16,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:02:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand 32075 states and 107493 transitions. [2019-12-27 16:02:16,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:02:16,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:16,271 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-27 16:02:16,272 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-27 16:02:16,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:16,272 INFO L82 PathProgramCache]: Analyzing trace with hash 454702152, now seen corresponding path program 1 times [2019-12-27 16:02:16,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:16,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328282876] [2019-12-27 16:02:16,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:16,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328282876] [2019-12-27 16:02:16,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:16,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:02:16,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [824905970] [2019-12-27 16:02:16,422 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:16,426 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:16,435 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 74 transitions. [2019-12-27 16:02:16,435 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:16,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:16,507 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:02:16,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:02:16,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:16,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:02:16,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:02:16,509 INFO L87 Difference]: Start difference. First operand 32075 states and 107493 transitions. Second operand 8 states. [2019-12-27 16:02:17,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:17,713 INFO L93 Difference]: Finished difference Result 51815 states and 170194 transitions. [2019-12-27 16:02:17,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 16:02:17,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 16:02:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:17,850 INFO L225 Difference]: With dead ends: 51815 [2019-12-27 16:02:17,851 INFO L226 Difference]: Without dead ends: 51775 [2019-12-27 16:02:17,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:02:18,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51775 states. [2019-12-27 16:02:18,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51775 to 32855. [2019-12-27 16:02:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32855 states. [2019-12-27 16:02:19,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32855 states to 32855 states and 109306 transitions. [2019-12-27 16:02:19,236 INFO L78 Accepts]: Start accepts. Automaton has 32855 states and 109306 transitions. Word has length 22 [2019-12-27 16:02:19,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:19,237 INFO L462 AbstractCegarLoop]: Abstraction has 32855 states and 109306 transitions. [2019-12-27 16:02:19,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:02:19,237 INFO L276 IsEmpty]: Start isEmpty. Operand 32855 states and 109306 transitions. [2019-12-27 16:02:19,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:02:19,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:19,255 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:19,256 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-27 16:02:19,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:19,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1218687100, now seen corresponding path program 1 times [2019-12-27 16:02:19,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:19,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506833669] [2019-12-27 16:02:19,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:19,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506833669] [2019-12-27 16:02:19,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:19,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:19,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [728947437] [2019-12-27 16:02:19,312 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:19,316 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:19,321 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 16:02:19,321 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:19,322 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:19,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:02:19,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:19,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:02:19,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:02:19,323 INFO L87 Difference]: Start difference. First operand 32855 states and 109306 transitions. Second operand 4 states. [2019-12-27 16:02:19,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:19,407 INFO L93 Difference]: Finished difference Result 13439 states and 41508 transitions. [2019-12-27 16:02:19,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:02:19,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 16:02:19,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:19,434 INFO L225 Difference]: With dead ends: 13439 [2019-12-27 16:02:19,434 INFO L226 Difference]: Without dead ends: 13439 [2019-12-27 16:02:19,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:02:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13439 states. [2019-12-27 16:02:19,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13439 to 13198. [2019-12-27 16:02:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13198 states. [2019-12-27 16:02:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13198 states to 13198 states and 40797 transitions. [2019-12-27 16:02:19,754 INFO L78 Accepts]: Start accepts. Automaton has 13198 states and 40797 transitions. Word has length 25 [2019-12-27 16:02:19,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:19,754 INFO L462 AbstractCegarLoop]: Abstraction has 13198 states and 40797 transitions. [2019-12-27 16:02:19,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:02:19,755 INFO L276 IsEmpty]: Start isEmpty. Operand 13198 states and 40797 transitions. [2019-12-27 16:02:19,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:02:19,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:19,780 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:19,781 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-27 16:02:19,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:19,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1155983199, now seen corresponding path program 1 times [2019-12-27 16:02:19,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:19,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337504404] [2019-12-27 16:02:19,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:19,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337504404] [2019-12-27 16:02:19,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:19,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:02:19,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [901121306] [2019-12-27 16:02:19,886 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:19,896 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:19,946 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 105 states and 164 transitions. [2019-12-27 16:02:19,946 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:19,947 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:19,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:02:19,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:19,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:02:19,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:19,948 INFO L87 Difference]: Start difference. First operand 13198 states and 40797 transitions. Second operand 5 states. [2019-12-27 16:02:20,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:20,020 INFO L93 Difference]: Finished difference Result 11975 states and 37634 transitions. [2019-12-27 16:02:20,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:02:20,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 16:02:20,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:20,038 INFO L225 Difference]: With dead ends: 11975 [2019-12-27 16:02:20,038 INFO L226 Difference]: Without dead ends: 11927 [2019-12-27 16:02:20,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:20,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11927 states. [2019-12-27 16:02:20,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11927 to 11330. [2019-12-27 16:02:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11330 states. [2019-12-27 16:02:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11330 states to 11330 states and 35775 transitions. [2019-12-27 16:02:20,216 INFO L78 Accepts]: Start accepts. Automaton has 11330 states and 35775 transitions. Word has length 39 [2019-12-27 16:02:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:20,217 INFO L462 AbstractCegarLoop]: Abstraction has 11330 states and 35775 transitions. [2019-12-27 16:02:20,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:02:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 11330 states and 35775 transitions. [2019-12-27 16:02:20,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:02:20,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:20,233 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] [2019-12-27 16:02:20,233 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-27 16:02:20,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:20,234 INFO L82 PathProgramCache]: Analyzing trace with hash 588132615, now seen corresponding path program 1 times [2019-12-27 16:02:20,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:20,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672295378] [2019-12-27 16:02:20,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:20,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672295378] [2019-12-27 16:02:20,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:20,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:20,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1883469890] [2019-12-27 16:02:20,323 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:20,341 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:20,671 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 311 states and 597 transitions. [2019-12-27 16:02:20,671 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:20,687 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:02:20,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:02:20,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:20,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:02:20,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:20,688 INFO L87 Difference]: Start difference. First operand 11330 states and 35775 transitions. Second operand 5 states. [2019-12-27 16:02:20,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:20,983 INFO L93 Difference]: Finished difference Result 25878 states and 81150 transitions. [2019-12-27 16:02:20,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:02:20,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 16:02:20,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:21,006 INFO L225 Difference]: With dead ends: 25878 [2019-12-27 16:02:21,006 INFO L226 Difference]: Without dead ends: 14275 [2019-12-27 16:02:21,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:02:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14275 states. [2019-12-27 16:02:21,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14275 to 9591. [2019-12-27 16:02:21,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9591 states. [2019-12-27 16:02:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9591 states to 9591 states and 30157 transitions. [2019-12-27 16:02:21,181 INFO L78 Accepts]: Start accepts. Automaton has 9591 states and 30157 transitions. Word has length 53 [2019-12-27 16:02:21,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:21,182 INFO L462 AbstractCegarLoop]: Abstraction has 9591 states and 30157 transitions. [2019-12-27 16:02:21,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:02:21,182 INFO L276 IsEmpty]: Start isEmpty. Operand 9591 states and 30157 transitions. [2019-12-27 16:02:21,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:02:21,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:21,201 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] [2019-12-27 16:02:21,201 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-27 16:02:21,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:21,202 INFO L82 PathProgramCache]: Analyzing trace with hash 104371591, now seen corresponding path program 2 times [2019-12-27 16:02:21,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:21,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349429315] [2019-12-27 16:02:21,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:21,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349429315] [2019-12-27 16:02:21,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:21,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:02:21,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1093351751] [2019-12-27 16:02:21,295 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:21,311 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:21,514 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 402 transitions. [2019-12-27 16:02:21,514 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:21,593 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:02:21,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:02:21,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:21,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:02:21,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:02:21,595 INFO L87 Difference]: Start difference. First operand 9591 states and 30157 transitions. Second operand 8 states. [2019-12-27 16:02:22,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:22,861 INFO L93 Difference]: Finished difference Result 35605 states and 109950 transitions. [2019-12-27 16:02:22,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 16:02:22,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-27 16:02:22,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:22,905 INFO L225 Difference]: With dead ends: 35605 [2019-12-27 16:02:22,905 INFO L226 Difference]: Without dead ends: 28147 [2019-12-27 16:02:22,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-27 16:02:22,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28147 states. [2019-12-27 16:02:23,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28147 to 11535. [2019-12-27 16:02:23,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11535 states. [2019-12-27 16:02:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11535 states to 11535 states and 36476 transitions. [2019-12-27 16:02:23,346 INFO L78 Accepts]: Start accepts. Automaton has 11535 states and 36476 transitions. Word has length 53 [2019-12-27 16:02:23,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:23,347 INFO L462 AbstractCegarLoop]: Abstraction has 11535 states and 36476 transitions. [2019-12-27 16:02:23,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:02:23,347 INFO L276 IsEmpty]: Start isEmpty. Operand 11535 states and 36476 transitions. [2019-12-27 16:02:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:02:23,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:23,369 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] [2019-12-27 16:02:23,370 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-27 16:02:23,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:23,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1667433135, now seen corresponding path program 3 times [2019-12-27 16:02:23,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:23,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395314550] [2019-12-27 16:02:23,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:23,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395314550] [2019-12-27 16:02:23,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:23,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:02:23,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1482231167] [2019-12-27 16:02:23,467 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:23,482 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:23,657 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 411 transitions. [2019-12-27 16:02:23,657 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:23,731 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 16:02:23,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:02:23,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:23,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:02:23,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:02:23,732 INFO L87 Difference]: Start difference. First operand 11535 states and 36476 transitions. Second operand 7 states. [2019-12-27 16:02:24,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:24,146 INFO L93 Difference]: Finished difference Result 29605 states and 91432 transitions. [2019-12-27 16:02:24,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:02:24,146 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 16:02:24,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:24,194 INFO L225 Difference]: With dead ends: 29605 [2019-12-27 16:02:24,195 INFO L226 Difference]: Without dead ends: 21211 [2019-12-27 16:02:24,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:02:24,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21211 states. [2019-12-27 16:02:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21211 to 13586. [2019-12-27 16:02:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13586 states. [2019-12-27 16:02:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13586 states to 13586 states and 42809 transitions. [2019-12-27 16:02:24,467 INFO L78 Accepts]: Start accepts. Automaton has 13586 states and 42809 transitions. Word has length 53 [2019-12-27 16:02:24,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:24,467 INFO L462 AbstractCegarLoop]: Abstraction has 13586 states and 42809 transitions. [2019-12-27 16:02:24,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:02:24,467 INFO L276 IsEmpty]: Start isEmpty. Operand 13586 states and 42809 transitions. [2019-12-27 16:02:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:02:24,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:24,487 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] [2019-12-27 16:02:24,487 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-27 16:02:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:24,488 INFO L82 PathProgramCache]: Analyzing trace with hash 750976839, now seen corresponding path program 4 times [2019-12-27 16:02:24,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:24,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853666287] [2019-12-27 16:02:24,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:24,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:24,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853666287] [2019-12-27 16:02:24,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:24,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:02:24,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1917309380] [2019-12-27 16:02:24,584 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:24,599 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:24,882 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 355 transitions. [2019-12-27 16:02:24,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:25,071 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 16:02:25,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:02:25,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:25,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:02:25,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:02:25,073 INFO L87 Difference]: Start difference. First operand 13586 states and 42809 transitions. Second operand 9 states. [2019-12-27 16:02:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:26,344 INFO L93 Difference]: Finished difference Result 74032 states and 231635 transitions. [2019-12-27 16:02:26,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 16:02:26,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-27 16:02:26,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:26,441 INFO L225 Difference]: With dead ends: 74032 [2019-12-27 16:02:26,442 INFO L226 Difference]: Without dead ends: 61001 [2019-12-27 16:02:26,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 17 SyntacticMatches, 15 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=268, Invalid=992, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 16:02:26,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61001 states. [2019-12-27 16:02:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61001 to 19263. [2019-12-27 16:02:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19263 states. [2019-12-27 16:02:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19263 states to 19263 states and 60991 transitions. [2019-12-27 16:02:27,035 INFO L78 Accepts]: Start accepts. Automaton has 19263 states and 60991 transitions. Word has length 53 [2019-12-27 16:02:27,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:27,035 INFO L462 AbstractCegarLoop]: Abstraction has 19263 states and 60991 transitions. [2019-12-27 16:02:27,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:02:27,035 INFO L276 IsEmpty]: Start isEmpty. Operand 19263 states and 60991 transitions. [2019-12-27 16:02:27,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:02:27,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:27,056 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] [2019-12-27 16:02:27,056 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-27 16:02:27,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:27,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1191615376, now seen corresponding path program 1 times [2019-12-27 16:02:27,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:27,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788753060] [2019-12-27 16:02:27,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:27,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788753060] [2019-12-27 16:02:27,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:27,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:27,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [115067608] [2019-12-27 16:02:27,119 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:27,135 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:27,406 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 291 transitions. [2019-12-27 16:02:27,406 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:27,423 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:02:27,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:02:27,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:27,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:02:27,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:27,424 INFO L87 Difference]: Start difference. First operand 19263 states and 60991 transitions. Second operand 3 states. [2019-12-27 16:02:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:27,543 INFO L93 Difference]: Finished difference Result 22534 states and 70090 transitions. [2019-12-27 16:02:27,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:27,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 16:02:27,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:27,577 INFO L225 Difference]: With dead ends: 22534 [2019-12-27 16:02:27,578 INFO L226 Difference]: Without dead ends: 22534 [2019-12-27 16:02:27,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:27,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22534 states. [2019-12-27 16:02:27,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22534 to 16447. [2019-12-27 16:02:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16447 states. [2019-12-27 16:02:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16447 states to 16447 states and 51755 transitions. [2019-12-27 16:02:27,862 INFO L78 Accepts]: Start accepts. Automaton has 16447 states and 51755 transitions. Word has length 53 [2019-12-27 16:02:27,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:27,862 INFO L462 AbstractCegarLoop]: Abstraction has 16447 states and 51755 transitions. [2019-12-27 16:02:27,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:02:27,862 INFO L276 IsEmpty]: Start isEmpty. Operand 16447 states and 51755 transitions. [2019-12-27 16:02:27,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:02:27,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:27,881 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] [2019-12-27 16:02:27,881 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-27 16:02:27,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:27,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2090423977, now seen corresponding path program 5 times [2019-12-27 16:02:27,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:27,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639683678] [2019-12-27 16:02:27,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:27,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639683678] [2019-12-27 16:02:27,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:27,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:27,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [700847537] [2019-12-27 16:02:27,926 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:27,941 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:28,148 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 268 states and 495 transitions. [2019-12-27 16:02:28,148 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:28,182 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 16:02:28,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:02:28,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:28,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:02:28,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:28,183 INFO L87 Difference]: Start difference. First operand 16447 states and 51755 transitions. Second operand 3 states. [2019-12-27 16:02:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:28,259 INFO L93 Difference]: Finished difference Result 18301 states and 55151 transitions. [2019-12-27 16:02:28,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:28,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 16:02:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:28,282 INFO L225 Difference]: With dead ends: 18301 [2019-12-27 16:02:28,282 INFO L226 Difference]: Without dead ends: 17640 [2019-12-27 16:02:28,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:28,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17640 states. [2019-12-27 16:02:28,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17640 to 15749. [2019-12-27 16:02:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15749 states. [2019-12-27 16:02:28,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15749 states to 15749 states and 47846 transitions. [2019-12-27 16:02:28,521 INFO L78 Accepts]: Start accepts. Automaton has 15749 states and 47846 transitions. Word has length 53 [2019-12-27 16:02:28,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:28,521 INFO L462 AbstractCegarLoop]: Abstraction has 15749 states and 47846 transitions. [2019-12-27 16:02:28,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:02:28,521 INFO L276 IsEmpty]: Start isEmpty. Operand 15749 states and 47846 transitions. [2019-12-27 16:02:28,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:02:28,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:28,543 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] [2019-12-27 16:02:28,543 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-27 16:02:28,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:28,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1578630746, now seen corresponding path program 1 times [2019-12-27 16:02:28,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:28,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378439321] [2019-12-27 16:02:28,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:28,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:28,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378439321] [2019-12-27 16:02:28,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:28,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:02:28,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [347050693] [2019-12-27 16:02:28,648 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:28,663 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:28,968 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 268 states and 495 transitions. [2019-12-27 16:02:28,968 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:29,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:29,183 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 16:02:29,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:02:29,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:29,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:02:29,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:02:29,184 INFO L87 Difference]: Start difference. First operand 15749 states and 47846 transitions. Second operand 10 states. [2019-12-27 16:02:31,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:31,302 INFO L93 Difference]: Finished difference Result 30775 states and 90554 transitions. [2019-12-27 16:02:31,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 16:02:31,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-27 16:02:31,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:31,348 INFO L225 Difference]: With dead ends: 30775 [2019-12-27 16:02:31,349 INFO L226 Difference]: Without dead ends: 30665 [2019-12-27 16:02:31,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-12-27 16:02:31,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30665 states. [2019-12-27 16:02:31,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30665 to 19681. [2019-12-27 16:02:31,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19681 states. [2019-12-27 16:02:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19681 states to 19681 states and 59031 transitions. [2019-12-27 16:02:31,742 INFO L78 Accepts]: Start accepts. Automaton has 19681 states and 59031 transitions. Word has length 53 [2019-12-27 16:02:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:31,742 INFO L462 AbstractCegarLoop]: Abstraction has 19681 states and 59031 transitions. [2019-12-27 16:02:31,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:02:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 19681 states and 59031 transitions. [2019-12-27 16:02:31,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:02:31,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:31,764 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] [2019-12-27 16:02:31,764 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-27 16:02:31,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:31,765 INFO L82 PathProgramCache]: Analyzing trace with hash -74918758, now seen corresponding path program 2 times [2019-12-27 16:02:31,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:31,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304875545] [2019-12-27 16:02:31,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:31,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304875545] [2019-12-27 16:02:31,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:31,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:02:31,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1999155980] [2019-12-27 16:02:31,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:31,900 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:32,405 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 363 transitions. [2019-12-27 16:02:32,405 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:32,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:32,653 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 16:02:32,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:02:32,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:32,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:02:32,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:02:32,655 INFO L87 Difference]: Start difference. First operand 19681 states and 59031 transitions. Second operand 12 states. [2019-12-27 16:02:36,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:36,483 INFO L93 Difference]: Finished difference Result 52056 states and 151777 transitions. [2019-12-27 16:02:36,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 16:02:36,484 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-12-27 16:02:36,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:36,556 INFO L225 Difference]: With dead ends: 52056 [2019-12-27 16:02:36,556 INFO L226 Difference]: Without dead ends: 51946 [2019-12-27 16:02:36,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 30 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=445, Invalid=1717, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 16:02:36,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51946 states. [2019-12-27 16:02:37,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51946 to 20787. [2019-12-27 16:02:37,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20787 states. [2019-12-27 16:02:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20787 states to 20787 states and 62200 transitions. [2019-12-27 16:02:37,144 INFO L78 Accepts]: Start accepts. Automaton has 20787 states and 62200 transitions. Word has length 53 [2019-12-27 16:02:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:37,144 INFO L462 AbstractCegarLoop]: Abstraction has 20787 states and 62200 transitions. [2019-12-27 16:02:37,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:02:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 20787 states and 62200 transitions. [2019-12-27 16:02:37,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:02:37,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:37,165 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] [2019-12-27 16:02:37,165 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-27 16:02:37,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:37,165 INFO L82 PathProgramCache]: Analyzing trace with hash 638104790, now seen corresponding path program 3 times [2019-12-27 16:02:37,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:37,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639905236] [2019-12-27 16:02:37,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:37,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639905236] [2019-12-27 16:02:37,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:37,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:02:37,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [836454506] [2019-12-27 16:02:37,236 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:37,250 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:37,543 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 311 transitions. [2019-12-27 16:02:37,543 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:37,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:37,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:02:37,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:37,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:02:37,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:37,544 INFO L87 Difference]: Start difference. First operand 20787 states and 62200 transitions. Second operand 3 states. [2019-12-27 16:02:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:37,608 INFO L93 Difference]: Finished difference Result 20787 states and 62198 transitions. [2019-12-27 16:02:37,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:37,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 16:02:37,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:37,637 INFO L225 Difference]: With dead ends: 20787 [2019-12-27 16:02:37,638 INFO L226 Difference]: Without dead ends: 20787 [2019-12-27 16:02:37,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:37,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20787 states. [2019-12-27 16:02:37,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20787 to 16285. [2019-12-27 16:02:37,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16285 states. [2019-12-27 16:02:37,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16285 states to 16285 states and 49785 transitions. [2019-12-27 16:02:37,916 INFO L78 Accepts]: Start accepts. Automaton has 16285 states and 49785 transitions. Word has length 53 [2019-12-27 16:02:37,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:37,916 INFO L462 AbstractCegarLoop]: Abstraction has 16285 states and 49785 transitions. [2019-12-27 16:02:37,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:02:37,916 INFO L276 IsEmpty]: Start isEmpty. Operand 16285 states and 49785 transitions. [2019-12-27 16:02:37,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 16:02:37,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:37,933 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:37,933 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-27 16:02:37,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:37,933 INFO L82 PathProgramCache]: Analyzing trace with hash -6191814, now seen corresponding path program 1 times [2019-12-27 16:02:37,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:37,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983877738] [2019-12-27 16:02:37,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:37,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983877738] [2019-12-27 16:02:37,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:37,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:02:37,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [614946353] [2019-12-27 16:02:37,990 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:38,003 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:38,185 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 269 states and 496 transitions. [2019-12-27 16:02:38,185 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:38,197 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:02:38,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:02:38,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:38,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:02:38,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:02:38,199 INFO L87 Difference]: Start difference. First operand 16285 states and 49785 transitions. Second operand 4 states. [2019-12-27 16:02:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:38,398 INFO L93 Difference]: Finished difference Result 16220 states and 48108 transitions. [2019-12-27 16:02:38,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:02:38,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 16:02:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:38,420 INFO L225 Difference]: With dead ends: 16220 [2019-12-27 16:02:38,420 INFO L226 Difference]: Without dead ends: 16220 [2019-12-27 16:02:38,421 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-27 16:02:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16220 states. [2019-12-27 16:02:38,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16220 to 11767. [2019-12-27 16:02:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11767 states. [2019-12-27 16:02:38,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11767 states to 11767 states and 35347 transitions. [2019-12-27 16:02:38,622 INFO L78 Accepts]: Start accepts. Automaton has 11767 states and 35347 transitions. Word has length 54 [2019-12-27 16:02:38,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:38,622 INFO L462 AbstractCegarLoop]: Abstraction has 11767 states and 35347 transitions. [2019-12-27 16:02:38,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:02:38,622 INFO L276 IsEmpty]: Start isEmpty. Operand 11767 states and 35347 transitions. [2019-12-27 16:02:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 16:02:38,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:38,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:38,635 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-27 16:02:38,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:38,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1003034569, now seen corresponding path program 1 times [2019-12-27 16:02:38,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:38,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321844722] [2019-12-27 16:02:38,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:38,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:38,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321844722] [2019-12-27 16:02:38,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:38,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:02:38,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [181182037] [2019-12-27 16:02:38,732 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:38,747 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:39,125 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 215 states and 421 transitions. [2019-12-27 16:02:39,126 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:39,228 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 16:02:39,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:02:39,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:39,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:02:39,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:02:39,230 INFO L87 Difference]: Start difference. First operand 11767 states and 35347 transitions. Second operand 9 states. [2019-12-27 16:02:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:40,564 INFO L93 Difference]: Finished difference Result 29566 states and 88338 transitions. [2019-12-27 16:02:40,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 16:02:40,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 16:02:40,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:40,605 INFO L225 Difference]: With dead ends: 29566 [2019-12-27 16:02:40,605 INFO L226 Difference]: Without dead ends: 25207 [2019-12-27 16:02:40,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:02:40,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25207 states. [2019-12-27 16:02:40,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25207 to 12308. [2019-12-27 16:02:40,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12308 states. [2019-12-27 16:02:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12308 states to 12308 states and 36615 transitions. [2019-12-27 16:02:40,881 INFO L78 Accepts]: Start accepts. Automaton has 12308 states and 36615 transitions. Word has length 55 [2019-12-27 16:02:40,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:40,882 INFO L462 AbstractCegarLoop]: Abstraction has 12308 states and 36615 transitions. [2019-12-27 16:02:40,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:02:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 12308 states and 36615 transitions. [2019-12-27 16:02:40,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 16:02:40,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:40,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:40,897 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-27 16:02:40,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:40,897 INFO L82 PathProgramCache]: Analyzing trace with hash -367516305, now seen corresponding path program 2 times [2019-12-27 16:02:40,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:40,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366104665] [2019-12-27 16:02:40,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:40,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366104665] [2019-12-27 16:02:40,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:40,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:02:40,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1666148565] [2019-12-27 16:02:40,993 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:41,010 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:41,155 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 350 transitions. [2019-12-27 16:02:41,156 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:41,244 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:02:41,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:02:41,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:41,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:02:41,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:02:41,245 INFO L87 Difference]: Start difference. First operand 12308 states and 36615 transitions. Second operand 9 states. [2019-12-27 16:02:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:42,248 INFO L93 Difference]: Finished difference Result 21113 states and 62320 transitions. [2019-12-27 16:02:42,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 16:02:42,249 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 16:02:42,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:42,275 INFO L225 Difference]: With dead ends: 21113 [2019-12-27 16:02:42,276 INFO L226 Difference]: Without dead ends: 17884 [2019-12-27 16:02:42,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:02:42,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17884 states. [2019-12-27 16:02:42,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17884 to 12140. [2019-12-27 16:02:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12140 states. [2019-12-27 16:02:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12140 states to 12140 states and 36091 transitions. [2019-12-27 16:02:42,494 INFO L78 Accepts]: Start accepts. Automaton has 12140 states and 36091 transitions. Word has length 55 [2019-12-27 16:02:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:42,494 INFO L462 AbstractCegarLoop]: Abstraction has 12140 states and 36091 transitions. [2019-12-27 16:02:42,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:02:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 12140 states and 36091 transitions. [2019-12-27 16:02:42,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 16:02:42,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:42,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:42,508 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-27 16:02:42,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:42,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1545411663, now seen corresponding path program 3 times [2019-12-27 16:02:42,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:42,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169408382] [2019-12-27 16:02:42,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:42,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:42,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169408382] [2019-12-27 16:02:42,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:42,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:02:42,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1713986435] [2019-12-27 16:02:42,666 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:42,680 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:42,947 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 353 transitions. [2019-12-27 16:02:42,947 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:43,091 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 16:02:43,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:02:43,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:43,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:02:43,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:02:43,092 INFO L87 Difference]: Start difference. First operand 12140 states and 36091 transitions. Second operand 14 states. [2019-12-27 16:02:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:47,244 INFO L93 Difference]: Finished difference Result 32776 states and 96292 transitions. [2019-12-27 16:02:47,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-12-27 16:02:47,244 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-12-27 16:02:47,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:47,291 INFO L225 Difference]: With dead ends: 32776 [2019-12-27 16:02:47,291 INFO L226 Difference]: Without dead ends: 32210 [2019-12-27 16:02:47,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2161 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=982, Invalid=5338, Unknown=0, NotChecked=0, Total=6320 [2019-12-27 16:02:47,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32210 states. [2019-12-27 16:02:47,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32210 to 14316. [2019-12-27 16:02:47,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14316 states. [2019-12-27 16:02:47,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14316 states to 14316 states and 42061 transitions. [2019-12-27 16:02:47,621 INFO L78 Accepts]: Start accepts. Automaton has 14316 states and 42061 transitions. Word has length 55 [2019-12-27 16:02:47,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:47,622 INFO L462 AbstractCegarLoop]: Abstraction has 14316 states and 42061 transitions. [2019-12-27 16:02:47,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:02:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand 14316 states and 42061 transitions. [2019-12-27 16:02:47,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 16:02:47,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:47,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:47,637 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-27 16:02:47,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:47,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1318747633, now seen corresponding path program 4 times [2019-12-27 16:02:47,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:47,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177547591] [2019-12-27 16:02:47,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:47,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177547591] [2019-12-27 16:02:47,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:47,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:02:47,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1203360852] [2019-12-27 16:02:47,792 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:47,807 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:47,995 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 395 transitions. [2019-12-27 16:02:47,995 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:48,363 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 16:02:48,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 16:02:48,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:48,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 16:02:48,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:02:48,365 INFO L87 Difference]: Start difference. First operand 14316 states and 42061 transitions. Second operand 16 states. [2019-12-27 16:02:56,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:56,983 INFO L93 Difference]: Finished difference Result 46339 states and 135337 transitions. [2019-12-27 16:02:56,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-12-27 16:02:56,983 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-27 16:02:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:57,056 INFO L225 Difference]: With dead ends: 46339 [2019-12-27 16:02:57,056 INFO L226 Difference]: Without dead ends: 45735 [2019-12-27 16:02:57,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 17 SyntacticMatches, 12 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7695 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2382, Invalid=16800, Unknown=0, NotChecked=0, Total=19182 [2019-12-27 16:02:57,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45735 states. [2019-12-27 16:02:57,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45735 to 13942. [2019-12-27 16:02:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13942 states. [2019-12-27 16:02:57,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13942 states to 13942 states and 41069 transitions. [2019-12-27 16:02:57,462 INFO L78 Accepts]: Start accepts. Automaton has 13942 states and 41069 transitions. Word has length 55 [2019-12-27 16:02:57,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:57,462 INFO L462 AbstractCegarLoop]: Abstraction has 13942 states and 41069 transitions. [2019-12-27 16:02:57,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 16:02:57,462 INFO L276 IsEmpty]: Start isEmpty. Operand 13942 states and 41069 transitions. [2019-12-27 16:02:57,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 16:02:57,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:57,476 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:57,476 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:57,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:57,477 INFO L82 PathProgramCache]: Analyzing trace with hash -767893923, now seen corresponding path program 5 times [2019-12-27 16:02:57,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:57,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446380746] [2019-12-27 16:02:57,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:57,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446380746] [2019-12-27 16:02:57,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:57,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:02:57,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1428016887] [2019-12-27 16:02:57,684 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:57,702 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:57,840 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 338 transitions. [2019-12-27 16:02:57,841 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:57,890 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 16:02:57,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:02:57,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:57,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:02:57,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:02:57,891 INFO L87 Difference]: Start difference. First operand 13942 states and 41069 transitions. Second operand 12 states. [2019-12-27 16:02:58,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:58,842 INFO L93 Difference]: Finished difference Result 22216 states and 64967 transitions. [2019-12-27 16:02:58,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 16:02:58,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-27 16:02:58,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:58,867 INFO L225 Difference]: With dead ends: 22216 [2019-12-27 16:02:58,867 INFO L226 Difference]: Without dead ends: 18191 [2019-12-27 16:02:58,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2019-12-27 16:02:58,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18191 states. [2019-12-27 16:02:59,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18191 to 11486. [2019-12-27 16:02:59,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11486 states. [2019-12-27 16:02:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11486 states to 11486 states and 34223 transitions. [2019-12-27 16:02:59,074 INFO L78 Accepts]: Start accepts. Automaton has 11486 states and 34223 transitions. Word has length 55 [2019-12-27 16:02:59,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:59,074 INFO L462 AbstractCegarLoop]: Abstraction has 11486 states and 34223 transitions. [2019-12-27 16:02:59,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:02:59,074 INFO L276 IsEmpty]: Start isEmpty. Operand 11486 states and 34223 transitions. [2019-12-27 16:02:59,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 16:02:59,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:59,085 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:59,086 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:59,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:59,086 INFO L82 PathProgramCache]: Analyzing trace with hash -238462213, now seen corresponding path program 6 times [2019-12-27 16:02:59,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:59,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967970909] [2019-12-27 16:02:59,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:02:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:02:59,182 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:02:59,182 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:02:59,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t412~0.base_40| 1)) (= 0 v_~__unbuffered_p2_EAX~0_40) (= 0 v_~__unbuffered_p0_EAX~0_50) (= 0 v_~x$w_buff0~0_407) (= 0 v_~weak$$choice0~0_14) (= v_~__unbuffered_cnt~0_133 0) (= 0 v_~x$w_buff0_used~0_981) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~x$r_buff1_thd1~0_402 0) (= 0 v_~x$w_buff1~0_314) (= v_~x$flush_delayed~0_48 0) (= 0 v_~x$read_delayed_var~0.base_8) (= 0 v_~x~0_233) (= 0 v_~x$r_buff0_thd2~0_329) (< 0 |v_#StackHeapBarrier_15|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t412~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t412~0.base_40|) |v_ULTIMATE.start_main_~#t412~0.offset_28| 0)) |v_#memory_int_17|) (= 0 v_~x$r_buff0_thd3~0_134) (= v_~__unbuffered_p1_EAX~0_219 0) (= 0 v_~x$w_buff1_used~0_593) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= v_~x$r_buff0_thd1~0_388 0) (= |v_ULTIMATE.start_main_~#t412~0.offset_28| 0) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed_var~0.offset_8) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_17 0) (= v_~main$tmp_guard0~0_20 0) (= v_~x$r_buff0_thd0~0_141 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t412~0.base_40|) 0) (= |v_#NULL.offset_4| 0) (= v_~weak$$choice2~0_186 0) (= v_~y~0_68 0) (= 0 v_~x$r_buff1_thd3~0_275) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t412~0.base_40|) (= v_~__unbuffered_p2_EBX~0_40 0) (= v_~x$r_buff1_thd0~0_274 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t412~0.base_40| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_407, ULTIMATE.start_main_~#t414~0.base=|v_ULTIMATE.start_main_~#t414~0.base_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_48, ULTIMATE.start_main_~#t412~0.offset=|v_ULTIMATE.start_main_~#t412~0.offset_28|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_402, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_43|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_50, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_219, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_593, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, ~x~0=v_~x~0_233, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_388, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_73|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_17, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_127|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_49|, ~y~0=v_~y~0_68, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_19|, ULTIMATE.start_main_~#t412~0.base=|v_ULTIMATE.start_main_~#t412~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_~#t413~0.base=|v_ULTIMATE.start_main_~#t413~0.base_32|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_274, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_329, ULTIMATE.start_main_~#t414~0.offset=|v_ULTIMATE.start_main_~#t414~0.offset_16|, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_981, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_77|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_186, ULTIMATE.start_main_~#t413~0.offset=|v_ULTIMATE.start_main_~#t413~0.offset_23|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t414~0.base, ~x$flush_delayed~0, ULTIMATE.start_main_~#t412~0.offset, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~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, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t412~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t413~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t414~0.offset, #NULL.base, ~x$w_buff0_used~0, 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, ULTIMATE.start_main_~#t413~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 16:02:59,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L823-1-->L825: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t413~0.base_11|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t413~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t413~0.base_11|) |v_ULTIMATE.start_main_~#t413~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t413~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t413~0.offset_10|) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t413~0.base_11| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t413~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t413~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_15|, ULTIMATE.start_main_~#t413~0.base=|v_ULTIMATE.start_main_~#t413~0.base_11|, ULTIMATE.start_main_~#t413~0.offset=|v_ULTIMATE.start_main_~#t413~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t413~0.base, ULTIMATE.start_main_~#t413~0.offset] because there is no mapped edge [2019-12-27 16:02:59,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_11 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_9|) (= v_~x$w_buff1_used~0_59 v_~x$w_buff0_used~0_123) (= 1 v_~x$w_buff0~0_27) (= v_P1Thread1of1ForFork0_~arg.offset_9 |v_P1Thread1of1ForFork0_#in~arg.offset_9|) (= 1 v_~x$w_buff0_used~0_122) (= 0 (mod v_~x$w_buff1_used~0_59 256)) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_9|) (= v_P1Thread1of1ForFork0_~arg.base_9 |v_P1Thread1of1ForFork0_#in~arg.base_9|) (= v_~x$w_buff0~0_28 v_~x$w_buff1~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_28, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_27, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_11, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_9|, ~x$w_buff1~0=v_~x$w_buff1~0_20, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_122} 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-27 16:02:59,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L825-1-->L827: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t414~0.offset_10|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t414~0.base_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t414~0.base_11|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t414~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t414~0.base_11|) |v_ULTIMATE.start_main_~#t414~0.offset_10| 2))) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t414~0.base_11| 1) |v_#valid_33|) (not (= |v_ULTIMATE.start_main_~#t414~0.base_11| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t414~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t414~0.base=|v_ULTIMATE.start_main_~#t414~0.base_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|, ULTIMATE.start_main_~#t414~0.offset=|v_ULTIMATE.start_main_~#t414~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t414~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t414~0.offset] because there is no mapped edge [2019-12-27 16:02:59,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L800-2-->L800-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In-1115249937 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1115249937 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-1115249937| ~x~0_In-1115249937)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In-1115249937 |P2Thread1of1ForFork1_#t~ite32_Out-1115249937|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1115249937, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1115249937, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1115249937, ~x~0=~x~0_In-1115249937} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1115249937|, ~x$w_buff1~0=~x$w_buff1~0_In-1115249937, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1115249937, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1115249937, ~x~0=~x~0_In-1115249937} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 16:02:59,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1858119365 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1858119365 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1858119365| 0)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1858119365| ~x$w_buff0_used~0_In-1858119365) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1858119365, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1858119365} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1858119365, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1858119365|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1858119365} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 16:02:59,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In-98538790 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-98538790 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-98538790 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-98538790 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out-98538790| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out-98538790| ~x$w_buff1_used~0_In-98538790)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-98538790, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-98538790, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-98538790, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-98538790} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-98538790, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-98538790, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-98538790, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-98538790|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-98538790} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 16:02:59,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1311407122 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1311407122 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-1311407122) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-1311407122 ~x$r_buff0_thd2~0_Out-1311407122) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1311407122, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1311407122} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1311407122|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1311407122, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1311407122} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 16:02:59,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1530117977 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-1530117977 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1530117977 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1530117977 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-1530117977| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite31_Out-1530117977| ~x$r_buff1_thd2~0_In-1530117977) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1530117977, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1530117977, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1530117977, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1530117977} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1530117977|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1530117977, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1530117977, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1530117977, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1530117977} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 16:02:59,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_51 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, 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-27 16:02:59,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L744-->L744-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-266699097 256)))) (or (and (= ~x$w_buff0_used~0_In-266699097 |P0Thread1of1ForFork2_#t~ite14_Out-266699097|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-266699097 256)))) (or (= (mod ~x$w_buff0_used~0_In-266699097 256) 0) (and (= (mod ~x$w_buff1_used~0_In-266699097 256) 0) .cse0) (and (= (mod ~x$r_buff1_thd1~0_In-266699097 256) 0) .cse0))) .cse1 (= |P0Thread1of1ForFork2_#t~ite15_Out-266699097| |P0Thread1of1ForFork2_#t~ite14_Out-266699097|)) (and (= |P0Thread1of1ForFork2_#t~ite14_In-266699097| |P0Thread1of1ForFork2_#t~ite14_Out-266699097|) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite15_Out-266699097| ~x$w_buff0_used~0_In-266699097)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-266699097, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-266699097, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-266699097, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-266699097|, ~weak$$choice2~0=~weak$$choice2~0_In-266699097, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-266699097} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-266699097, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-266699097, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-266699097|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-266699097, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-266699097|, ~weak$$choice2~0=~weak$$choice2~0_In-266699097, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-266699097} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 16:02:59,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L745-->L745-8: Formula: (let ((.cse2 (= 0 (mod ~weak$$choice2~0_In-232434703 256))) (.cse3 (= |P0Thread1of1ForFork2_#t~ite18_Out-232434703| |P0Thread1of1ForFork2_#t~ite17_Out-232434703|)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-232434703 256))) (.cse6 (= (mod ~x$r_buff0_thd1~0_In-232434703 256) 0)) (.cse4 (= 0 (mod ~x$w_buff1_used~0_In-232434703 256))) (.cse5 (= (mod ~x$w_buff0_used~0_In-232434703 256) 0))) (or (let ((.cse0 (not .cse6))) (and (or .cse0 (not .cse1)) .cse2 .cse3 (or .cse0 (not .cse4)) (= |P0Thread1of1ForFork2_#t~ite16_Out-232434703| |P0Thread1of1ForFork2_#t~ite17_Out-232434703|) (= |P0Thread1of1ForFork2_#t~ite16_Out-232434703| 0) (not .cse5))) (and (or (and (not .cse2) (= |P0Thread1of1ForFork2_#t~ite18_Out-232434703| ~x$w_buff1_used~0_In-232434703) (= |P0Thread1of1ForFork2_#t~ite17_In-232434703| |P0Thread1of1ForFork2_#t~ite17_Out-232434703|)) (and .cse2 .cse3 (= ~x$w_buff1_used~0_In-232434703 |P0Thread1of1ForFork2_#t~ite17_Out-232434703|) (or (and .cse6 .cse1) (and .cse6 .cse4) .cse5))) (= |P0Thread1of1ForFork2_#t~ite16_In-232434703| |P0Thread1of1ForFork2_#t~ite16_Out-232434703|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-232434703, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-232434703|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-232434703, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In-232434703|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-232434703, ~weak$$choice2~0=~weak$$choice2~0_In-232434703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-232434703} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-232434703, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-232434703|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-232434703|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-232434703, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out-232434703|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-232434703, ~weak$$choice2~0=~weak$$choice2~0_In-232434703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-232434703} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 16:02:59,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L745-8-->L747: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite18_55| v_~x$w_buff1_used~0_577) (not (= 0 (mod v_~weak$$choice2~0_176 256))) (= v_~x$r_buff0_thd1~0_373 v_~x$r_buff0_thd1~0_372)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_373, P0Thread1of1ForFork2_#t~ite18=|v_P0Thread1of1ForFork2_#t~ite18_55|, ~weak$$choice2~0=v_~weak$$choice2~0_176} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_39|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_372, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, P0Thread1of1ForFork2_#t~ite18=|v_P0Thread1of1ForFork2_#t~ite18_54|, P0Thread1of1ForFork2_#t~ite17=|v_P0Thread1of1ForFork2_#t~ite17_48|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_577, P0Thread1of1ForFork2_#t~ite16=|v_P0Thread1of1ForFork2_#t~ite16_44|, ~weak$$choice2~0=v_~weak$$choice2~0_176, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, ~x$w_buff1_used~0, P0Thread1of1ForFork2_#t~ite16, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 16:02:59,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L800-4-->L801: Formula: (= v_~x~0_36 |v_P2Thread1of1ForFork1_#t~ite32_14|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_14|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_13|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_21|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 16:02:59,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L749-->L757: Formula: (and (= v_~x$flush_delayed~0_13 0) (not (= (mod v_~x$flush_delayed~0_14 256) 0)) (= v_~x$mem_tmp~0_5 v_~x~0_56) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 16:02:59,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-497259630 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-497259630 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-497259630| 0)) (and (= ~x$w_buff0_used~0_In-497259630 |P2Thread1of1ForFork1_#t~ite34_Out-497259630|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-497259630, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-497259630} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-497259630|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-497259630, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-497259630} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 16:02:59,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In763663746 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In763663746 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In763663746 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In763663746 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out763663746|)) (and (= ~x$w_buff1_used~0_In763663746 |P2Thread1of1ForFork1_#t~ite35_Out763663746|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In763663746, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In763663746, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In763663746, ~x$w_buff0_used~0=~x$w_buff0_used~0_In763663746} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out763663746|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In763663746, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In763663746, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In763663746, ~x$w_buff0_used~0=~x$w_buff0_used~0_In763663746} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 16:02:59,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In885238383 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In885238383 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out885238383| ~x$r_buff0_thd3~0_In885238383) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out885238383| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In885238383, ~x$w_buff0_used~0=~x$w_buff0_used~0_In885238383} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out885238383|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In885238383, ~x$w_buff0_used~0=~x$w_buff0_used~0_In885238383} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 16:02:59,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1860144106 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1860144106 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In1860144106 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1860144106 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1860144106|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out1860144106| ~x$r_buff1_thd3~0_In1860144106)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1860144106, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1860144106, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1860144106, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1860144106} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1860144106|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1860144106, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1860144106, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1860144106, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1860144106} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:02:59,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L804-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82) (= |v_P2Thread1of1ForFork1_#t~ite37_42| v_~x$r_buff1_thd3~0_144)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_41|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_144, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, 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-27 16:02:59,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L827-1-->L833: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:02:59,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-2-->L833-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-840258092 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite42_Out-840258092| |ULTIMATE.start_main_#t~ite41_Out-840258092|)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-840258092 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite41_Out-840258092| ~x~0_In-840258092)) (and (= ~x$w_buff1~0_In-840258092 |ULTIMATE.start_main_#t~ite41_Out-840258092|) (not .cse1) .cse2 (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-840258092, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-840258092, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-840258092, ~x~0=~x~0_In-840258092} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-840258092|, ~x$w_buff1~0=~x$w_buff1~0_In-840258092, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-840258092, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-840258092, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-840258092|, ~x~0=~x~0_In-840258092} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:02:59,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1294527054 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1294527054 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1294527054 |ULTIMATE.start_main_#t~ite43_Out-1294527054|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1294527054|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1294527054, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1294527054} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1294527054, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1294527054|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1294527054} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 16:02:59,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2027113839 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In2027113839 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In2027113839 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In2027113839 256) 0))) (or (and (= ~x$w_buff1_used~0_In2027113839 |ULTIMATE.start_main_#t~ite44_Out2027113839|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite44_Out2027113839|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2027113839, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2027113839, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2027113839, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2027113839} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2027113839, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2027113839, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2027113839, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2027113839|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2027113839} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 16:02:59,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In752871851 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In752871851 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In752871851 |ULTIMATE.start_main_#t~ite45_Out752871851|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out752871851|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In752871851, ~x$w_buff0_used~0=~x$w_buff0_used~0_In752871851} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In752871851, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out752871851|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In752871851} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 16:02:59,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-475922389 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-475922389 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-475922389 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-475922389 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-475922389|)) (and (= ~x$r_buff1_thd0~0_In-475922389 |ULTIMATE.start_main_#t~ite46_Out-475922389|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-475922389, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-475922389, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-475922389, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-475922389} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-475922389, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-475922389|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-475922389, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-475922389, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-475922389} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 16:02:59,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_22 256)) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~__unbuffered_p1_EAX~0_205 0) (= v_~__unbuffered_p2_EBX~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~x$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite46_45|) (= 0 v_~__unbuffered_p0_EAX~0_34) (= v_~main$tmp_guard1~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_205, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_45|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_205, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_44|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_258, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} 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-27 16:02:59,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:02:59 BasicIcfg [2019-12-27 16:02:59,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:02:59,303 INFO L168 Benchmark]: Toolchain (without parser) took 80628.78 ms. Allocated memory was 137.4 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 100.9 MB in the beginning and 797.1 MB in the end (delta: -696.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 16:02:59,303 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 16:02:59,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.83 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 100.5 MB in the beginning and 152.6 MB in the end (delta: -52.1 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-12-27 16:02:59,305 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.75 ms. Allocated memory is still 200.8 MB. Free memory was 152.6 MB in the beginning and 149.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:02:59,305 INFO L168 Benchmark]: Boogie Preprocessor took 37.82 ms. Allocated memory is still 200.8 MB. Free memory was 149.5 MB in the beginning and 147.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:02:59,306 INFO L168 Benchmark]: RCFGBuilder took 842.95 ms. Allocated memory is still 200.8 MB. Free memory was 147.5 MB in the beginning and 100.7 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:02:59,307 INFO L168 Benchmark]: TraceAbstraction took 78917.49 ms. Allocated memory was 200.8 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 99.7 MB in the beginning and 797.1 MB in the end (delta: -697.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 16:02:59,309 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 757.83 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 100.5 MB in the beginning and 152.6 MB in the end (delta: -52.1 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.75 ms. Allocated memory is still 200.8 MB. Free memory was 152.6 MB in the beginning and 149.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.82 ms. Allocated memory is still 200.8 MB. Free memory was 149.5 MB in the beginning and 147.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 842.95 ms. Allocated memory is still 200.8 MB. Free memory was 147.5 MB in the beginning and 100.7 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 78917.49 ms. Allocated memory was 200.8 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 99.7 MB in the beginning and 797.1 MB in the end (delta: -697.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 165 ProgramPointsBefore, 83 ProgramPointsAfterwards, 196 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 6986 VarBasedMoverChecksPositive, 284 VarBasedMoverChecksNegative, 112 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 75392 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t412, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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] [L825] FCALL, FORK 0 pthread_create(&t413, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] FCALL, FORK 0 pthread_create(&t414, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] 3 y = 1 [L794] 3 __unbuffered_p2_EAX = y [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=0] [L777] 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) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L734] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L741] 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)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L779] 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 [L741] 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) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L742] 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)) [L743] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L743] 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)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L747] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L747] 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)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L801] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] 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 [L803] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L835] 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 [L836] 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, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 78.6s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 35.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4974 SDtfs, 8922 SDslu, 21408 SDs, 0 SdLazy, 15151 SolverSat, 641 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 743 GetRequests, 190 SyntacticMatches, 98 SemanticMatches, 455 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11383 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86190occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 236458 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 992 NumberOfCodeBlocks, 992 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 915 ConstructedInterpolants, 0 QuantifiedInterpolants, 160235 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...