/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/mix027_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:31:58,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:31:58,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:31:58,423 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:31:58,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:31:58,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:31:58,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:31:58,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:31:58,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:31:58,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:31:58,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:31:58,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:31:58,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:31:58,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:31:58,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:31:58,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:31:58,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:31:58,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:31:58,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:31:58,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:31:58,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:31:58,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:31:58,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:31:58,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:31:58,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:31:58,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:31:58,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:31:58,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:31:58,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:31:58,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:31:58,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:31:58,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:31:58,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:31:58,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:31:58,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:31:58,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:31:58,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:31:58,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:31:58,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:31:58,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:31:58,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:31:58,470 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:31:58,490 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:31:58,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:31:58,491 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:31:58,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:31:58,492 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:31:58,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:31:58,492 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:31:58,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:31:58,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:31:58,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:31:58,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:31:58,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:31:58,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:31:58,494 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:31:58,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:31:58,494 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:31:58,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:31:58,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:31:58,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:31:58,495 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:31:58,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:31:58,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:31:58,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:31:58,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:31:58,496 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:31:58,496 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:31:58,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:31:58,497 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:31:58,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:31:58,497 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:31:58,497 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:31:58,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:31:58,797 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:31:58,800 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:31:58,802 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:31:58,802 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:31:58,804 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_pso.opt.i [2019-12-27 16:31:58,877 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d78c01f73/e997036ab92f4ba3844af5b2638edefa/FLAG47d36b549 [2019-12-27 16:31:59,421 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:31:59,422 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_pso.opt.i [2019-12-27 16:31:59,439 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d78c01f73/e997036ab92f4ba3844af5b2638edefa/FLAG47d36b549 [2019-12-27 16:31:59,726 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d78c01f73/e997036ab92f4ba3844af5b2638edefa [2019-12-27 16:31:59,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:31:59,738 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:31:59,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:31:59,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:31:59,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:31:59,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:31:59" (1/1) ... [2019-12-27 16:31:59,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba015a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:59, skipping insertion in model container [2019-12-27 16:31:59,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:31:59" (1/1) ... [2019-12-27 16:31:59,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:31:59,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:32:00,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:32:00,350 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:32:00,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:32:00,528 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:32:00,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:32:00 WrapperNode [2019-12-27 16:32:00,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:32:00,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:32:00,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:32:00,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:32:00,537 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:32:00" (1/1) ... [2019-12-27 16:32:00,558 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:32:00" (1/1) ... [2019-12-27 16:32:00,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:32:00,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:32:00,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:32:00,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:32:00,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:32:00" (1/1) ... [2019-12-27 16:32:00,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:32:00" (1/1) ... [2019-12-27 16:32:00,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:32:00" (1/1) ... [2019-12-27 16:32:00,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:32:00" (1/1) ... [2019-12-27 16:32:00,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:32:00" (1/1) ... [2019-12-27 16:32:00,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:32:00" (1/1) ... [2019-12-27 16:32:00,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:32:00" (1/1) ... [2019-12-27 16:32:00,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:32:00,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:32:00,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:32:00,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:32:00,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:32:00" (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:32:00,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:32:00,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:32:00,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:32:00,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:32:00,703 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:32:00,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:32:00,703 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:32:00,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:32:00,703 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:32:00,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:32:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 16:32:00,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 16:32:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:32:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:32:00,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:32:00,706 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:32:01,492 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:32:01,492 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:32:01,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:32:01 BoogieIcfgContainer [2019-12-27 16:32:01,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:32:01,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:32:01,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:32:01,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:32:01,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:31:59" (1/3) ... [2019-12-27 16:32:01,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b03bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:32:01, skipping insertion in model container [2019-12-27 16:32:01,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:32:00" (2/3) ... [2019-12-27 16:32:01,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b03bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:32:01, skipping insertion in model container [2019-12-27 16:32:01,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:32:01" (3/3) ... [2019-12-27 16:32:01,506 INFO L109 eAbstractionObserver]: Analyzing ICFG mix027_pso.opt.i [2019-12-27 16:32:01,517 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:32:01,518 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:32:01,527 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:32:01,528 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:32:01,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,588 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,588 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,591 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,591 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,630 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,630 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,631 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,631 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,631 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,637 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,637 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,638 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,638 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,639 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,639 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,639 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,639 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,639 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,652 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,653 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,660 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,660 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,664 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,667 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,671 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,671 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,671 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:32:01,689 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 16:32:01,713 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:32:01,713 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:32:01,713 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:32:01,714 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:32:01,714 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:32:01,714 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:32:01,714 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:32:01,714 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:32:01,737 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-27 16:32:01,743 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 16:32:01,855 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 16:32:01,855 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:32:01,871 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 16:32:01,898 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 16:32:01,954 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 16:32:01,955 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:32:01,963 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 16:32:01,984 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 16:32:01,985 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:32:07,271 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 16:32:07,792 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 16:32:07,954 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 16:32:07,988 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74757 [2019-12-27 16:32:07,988 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 16:32:07,992 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-27 16:32:46,843 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 171250 states. [2019-12-27 16:32:46,845 INFO L276 IsEmpty]: Start isEmpty. Operand 171250 states. [2019-12-27 16:32:46,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 16:32:46,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:32:46,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:32:46,852 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:32:46,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:32:46,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1969539409, now seen corresponding path program 1 times [2019-12-27 16:32:46,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:32:46,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719855649] [2019-12-27 16:32:46,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:32:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:32:47,402 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:32:47,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719855649] [2019-12-27 16:32:47,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:32:47,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:32:47,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [444857875] [2019-12-27 16:32:47,408 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:32:47,416 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:32:47,433 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 16:32:47,433 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:32:47,437 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:32:47,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:32:47,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:32:47,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:32:47,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:32:47,455 INFO L87 Difference]: Start difference. First operand 171250 states. Second operand 3 states. [2019-12-27 16:32:53,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:32:53,227 INFO L93 Difference]: Finished difference Result 169554 states and 814774 transitions. [2019-12-27 16:32:53,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:32:53,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 16:32:53,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:32:54,263 INFO L225 Difference]: With dead ends: 169554 [2019-12-27 16:32:54,263 INFO L226 Difference]: Without dead ends: 159076 [2019-12-27 16:32:54,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:33:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159076 states. [2019-12-27 16:33:06,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159076 to 159076. [2019-12-27 16:33:06,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159076 states. [2019-12-27 16:33:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159076 states to 159076 states and 763437 transitions. [2019-12-27 16:33:07,245 INFO L78 Accepts]: Start accepts. Automaton has 159076 states and 763437 transitions. Word has length 7 [2019-12-27 16:33:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:33:07,247 INFO L462 AbstractCegarLoop]: Abstraction has 159076 states and 763437 transitions. [2019-12-27 16:33:07,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:33:07,247 INFO L276 IsEmpty]: Start isEmpty. Operand 159076 states and 763437 transitions. [2019-12-27 16:33:07,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:33:07,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:33:07,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:33:07,265 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:33:07,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:33:07,266 INFO L82 PathProgramCache]: Analyzing trace with hash 230524214, now seen corresponding path program 1 times [2019-12-27 16:33:07,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:33:07,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004992561] [2019-12-27 16:33:07,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:33:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:33:07,412 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:33:07,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004992561] [2019-12-27 16:33:07,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:33:07,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:33:07,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [231954180] [2019-12-27 16:33:07,415 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:33:07,417 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:33:07,424 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 16:33:07,424 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:33:07,424 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:33:07,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:33:07,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:33:07,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:33:07,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:33:07,427 INFO L87 Difference]: Start difference. First operand 159076 states and 763437 transitions. Second operand 4 states. [2019-12-27 16:33:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:33:15,281 INFO L93 Difference]: Finished difference Result 251868 states and 1162713 transitions. [2019-12-27 16:33:15,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:33:15,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 16:33:15,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:33:16,989 INFO L225 Difference]: With dead ends: 251868 [2019-12-27 16:33:16,990 INFO L226 Difference]: Without dead ends: 251658 [2019-12-27 16:33:16,990 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:33:31,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251658 states. [2019-12-27 16:33:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251658 to 235278. [2019-12-27 16:33:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235278 states. [2019-12-27 16:33:38,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235278 states to 235278 states and 1094580 transitions. [2019-12-27 16:33:38,592 INFO L78 Accepts]: Start accepts. Automaton has 235278 states and 1094580 transitions. Word has length 15 [2019-12-27 16:33:38,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:33:38,592 INFO L462 AbstractCegarLoop]: Abstraction has 235278 states and 1094580 transitions. [2019-12-27 16:33:38,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:33:38,593 INFO L276 IsEmpty]: Start isEmpty. Operand 235278 states and 1094580 transitions. [2019-12-27 16:33:38,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:33:38,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:33:38,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:33:38,598 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:33:38,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:33:38,598 INFO L82 PathProgramCache]: Analyzing trace with hash -519494263, now seen corresponding path program 1 times [2019-12-27 16:33:38,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:33:38,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759716343] [2019-12-27 16:33:38,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:33:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:33:38,640 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:33:38,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759716343] [2019-12-27 16:33:38,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:33:38,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:33:38,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [915934208] [2019-12-27 16:33:38,645 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:33:38,647 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:33:38,649 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 16:33:38,649 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:33:38,650 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:33:38,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:33:38,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:33:38,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:33:38,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:33:38,651 INFO L87 Difference]: Start difference. First operand 235278 states and 1094580 transitions. Second operand 3 states. [2019-12-27 16:33:47,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:33:47,244 INFO L93 Difference]: Finished difference Result 146539 states and 614385 transitions. [2019-12-27 16:33:47,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:33:47,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 16:33:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:33:47,981 INFO L225 Difference]: With dead ends: 146539 [2019-12-27 16:33:47,982 INFO L226 Difference]: Without dead ends: 146539 [2019-12-27 16:33:47,982 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:33:52,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146539 states. [2019-12-27 16:33:54,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146539 to 146539. [2019-12-27 16:33:54,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146539 states. [2019-12-27 16:33:55,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146539 states to 146539 states and 614385 transitions. [2019-12-27 16:33:55,460 INFO L78 Accepts]: Start accepts. Automaton has 146539 states and 614385 transitions. Word has length 15 [2019-12-27 16:33:55,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:33:55,460 INFO L462 AbstractCegarLoop]: Abstraction has 146539 states and 614385 transitions. [2019-12-27 16:33:55,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:33:55,461 INFO L276 IsEmpty]: Start isEmpty. Operand 146539 states and 614385 transitions. [2019-12-27 16:33:55,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:33:55,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:33:55,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:33:55,467 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:33:55,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:33:55,467 INFO L82 PathProgramCache]: Analyzing trace with hash -839885588, now seen corresponding path program 1 times [2019-12-27 16:33:55,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:33:55,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624568536] [2019-12-27 16:33:55,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:33:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:33:55,523 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:33:55,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624568536] [2019-12-27 16:33:55,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:33:55,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:33:55,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1076832574] [2019-12-27 16:33:55,525 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:33:55,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:33:55,530 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 16:33:55,530 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:33:55,574 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:33:55,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:33:55,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:33:55,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:33:55,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:33:55,576 INFO L87 Difference]: Start difference. First operand 146539 states and 614385 transitions. Second operand 5 states. [2019-12-27 16:33:55,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:33:55,831 INFO L93 Difference]: Finished difference Result 40251 states and 143660 transitions. [2019-12-27 16:33:55,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:33:55,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 16:33:55,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:00,648 INFO L225 Difference]: With dead ends: 40251 [2019-12-27 16:34:00,648 INFO L226 Difference]: Without dead ends: 40251 [2019-12-27 16:34:00,649 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:34:00,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40251 states. [2019-12-27 16:34:01,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40251 to 40251. [2019-12-27 16:34:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40251 states. [2019-12-27 16:34:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40251 states to 40251 states and 143660 transitions. [2019-12-27 16:34:01,422 INFO L78 Accepts]: Start accepts. Automaton has 40251 states and 143660 transitions. Word has length 16 [2019-12-27 16:34:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:01,423 INFO L462 AbstractCegarLoop]: Abstraction has 40251 states and 143660 transitions. [2019-12-27 16:34:01,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:34:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 40251 states and 143660 transitions. [2019-12-27 16:34:01,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:34:01,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:01,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:01,426 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:01,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:01,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1627950887, now seen corresponding path program 1 times [2019-12-27 16:34:01,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:01,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342694919] [2019-12-27 16:34:01,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:01,503 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:34:01,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342694919] [2019-12-27 16:34:01,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:01,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:34:01,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1606946260] [2019-12-27 16:34:01,505 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:01,507 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:01,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 16:34:01,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:01,571 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:34:01,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:34:01,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:01,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:34:01,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:34:01,572 INFO L87 Difference]: Start difference. First operand 40251 states and 143660 transitions. Second operand 7 states. [2019-12-27 16:34:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:02,374 INFO L93 Difference]: Finished difference Result 58215 states and 204121 transitions. [2019-12-27 16:34:02,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:34:02,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-27 16:34:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:02,493 INFO L225 Difference]: With dead ends: 58215 [2019-12-27 16:34:02,493 INFO L226 Difference]: Without dead ends: 58197 [2019-12-27 16:34:02,493 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:34:03,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58197 states. [2019-12-27 16:34:03,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58197 to 46455. [2019-12-27 16:34:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46455 states. [2019-12-27 16:34:03,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46455 states to 46455 states and 165104 transitions. [2019-12-27 16:34:03,773 INFO L78 Accepts]: Start accepts. Automaton has 46455 states and 165104 transitions. Word has length 16 [2019-12-27 16:34:03,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:03,774 INFO L462 AbstractCegarLoop]: Abstraction has 46455 states and 165104 transitions. [2019-12-27 16:34:03,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:34:03,774 INFO L276 IsEmpty]: Start isEmpty. Operand 46455 states and 165104 transitions. [2019-12-27 16:34:03,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 16:34:03,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:03,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:03,795 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:03,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:03,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1520730132, now seen corresponding path program 1 times [2019-12-27 16:34:03,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:03,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892716447] [2019-12-27 16:34:03,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:03,908 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:34:03,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892716447] [2019-12-27 16:34:03,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:03,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:34:03,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [326931606] [2019-12-27 16:34:03,909 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:03,914 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:03,927 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 100 transitions. [2019-12-27 16:34:03,928 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:03,990 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:34:03,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:34:03,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:03,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:34:03,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:34:03,991 INFO L87 Difference]: Start difference. First operand 46455 states and 165104 transitions. Second operand 8 states. [2019-12-27 16:34:06,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:06,265 INFO L93 Difference]: Finished difference Result 142716 states and 495019 transitions. [2019-12-27 16:34:06,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 16:34:06,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-27 16:34:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:06,583 INFO L225 Difference]: With dead ends: 142716 [2019-12-27 16:34:06,584 INFO L226 Difference]: Without dead ends: 142663 [2019-12-27 16:34:06,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:34:07,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142663 states. [2019-12-27 16:34:08,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142663 to 69309. [2019-12-27 16:34:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69309 states. [2019-12-27 16:34:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69309 states to 69309 states and 246052 transitions. [2019-12-27 16:34:08,915 INFO L78 Accepts]: Start accepts. Automaton has 69309 states and 246052 transitions. Word has length 24 [2019-12-27 16:34:08,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:08,916 INFO L462 AbstractCegarLoop]: Abstraction has 69309 states and 246052 transitions. [2019-12-27 16:34:08,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:34:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 69309 states and 246052 transitions. [2019-12-27 16:34:08,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 16:34:08,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:08,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:08,940 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:08,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:08,940 INFO L82 PathProgramCache]: Analyzing trace with hash 536202934, now seen corresponding path program 2 times [2019-12-27 16:34:08,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:08,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102016458] [2019-12-27 16:34:08,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:09,017 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:34:09,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102016458] [2019-12-27 16:34:09,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:09,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:34:09,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [943237520] [2019-12-27 16:34:09,018 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:09,021 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:09,030 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 40 transitions. [2019-12-27 16:34:09,030 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:09,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:34:09,098 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:34:09,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:34:09,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:09,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:34:09,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:34:09,100 INFO L87 Difference]: Start difference. First operand 69309 states and 246052 transitions. Second operand 8 states. [2019-12-27 16:34:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:11,202 INFO L93 Difference]: Finished difference Result 103616 states and 358800 transitions. [2019-12-27 16:34:11,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 16:34:11,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-27 16:34:11,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:11,437 INFO L225 Difference]: With dead ends: 103616 [2019-12-27 16:34:11,438 INFO L226 Difference]: Without dead ends: 103594 [2019-12-27 16:34:11,438 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:34:11,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103594 states. [2019-12-27 16:34:13,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103594 to 62281. [2019-12-27 16:34:13,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62281 states. [2019-12-27 16:34:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62281 states to 62281 states and 221958 transitions. [2019-12-27 16:34:13,506 INFO L78 Accepts]: Start accepts. Automaton has 62281 states and 221958 transitions. Word has length 24 [2019-12-27 16:34:13,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:13,507 INFO L462 AbstractCegarLoop]: Abstraction has 62281 states and 221958 transitions. [2019-12-27 16:34:13,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:34:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 62281 states and 221958 transitions. [2019-12-27 16:34:13,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:34:13,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:13,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] [2019-12-27 16:34:13,543 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:13,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:13,544 INFO L82 PathProgramCache]: Analyzing trace with hash -560534453, now seen corresponding path program 1 times [2019-12-27 16:34:13,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:13,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503800357] [2019-12-27 16:34:13,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:34:13,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503800357] [2019-12-27 16:34:13,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:13,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:34:13,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1510428062] [2019-12-27 16:34:13,607 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:13,611 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:13,619 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 40 transitions. [2019-12-27 16:34:13,620 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:13,634 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:34:13,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:34:13,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:13,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:34:13,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:34:13,635 INFO L87 Difference]: Start difference. First operand 62281 states and 221958 transitions. Second operand 6 states. [2019-12-27 16:34:13,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:13,899 INFO L93 Difference]: Finished difference Result 34860 states and 126226 transitions. [2019-12-27 16:34:13,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:34:13,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 16:34:13,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:14,015 INFO L225 Difference]: With dead ends: 34860 [2019-12-27 16:34:14,016 INFO L226 Difference]: Without dead ends: 34860 [2019-12-27 16:34:14,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:34:14,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34860 states. [2019-12-27 16:34:14,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34860 to 33994. [2019-12-27 16:34:14,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33994 states. [2019-12-27 16:34:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33994 states to 33994 states and 123179 transitions. [2019-12-27 16:34:14,743 INFO L78 Accepts]: Start accepts. Automaton has 33994 states and 123179 transitions. Word has length 28 [2019-12-27 16:34:14,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:14,743 INFO L462 AbstractCegarLoop]: Abstraction has 33994 states and 123179 transitions. [2019-12-27 16:34:14,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:34:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 33994 states and 123179 transitions. [2019-12-27 16:34:14,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 16:34:14,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:14,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:14,803 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:14,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:14,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1812552662, now seen corresponding path program 1 times [2019-12-27 16:34:14,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:14,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506180790] [2019-12-27 16:34:14,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:14,908 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:34:14,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506180790] [2019-12-27 16:34:14,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:14,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:34:14,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [348320280] [2019-12-27 16:34:14,909 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:15,123 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:15,161 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 131 transitions. [2019-12-27 16:34:15,161 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:15,177 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:34:15,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:34:15,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:15,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:34:15,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:34:15,178 INFO L87 Difference]: Start difference. First operand 33994 states and 123179 transitions. Second operand 5 states. [2019-12-27 16:34:15,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:15,377 INFO L93 Difference]: Finished difference Result 49156 states and 170197 transitions. [2019-12-27 16:34:15,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:34:15,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 16:34:15,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:15,448 INFO L225 Difference]: With dead ends: 49156 [2019-12-27 16:34:15,448 INFO L226 Difference]: Without dead ends: 34506 [2019-12-27 16:34:15,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:34:15,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34506 states. [2019-12-27 16:34:16,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34506 to 34228. [2019-12-27 16:34:16,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34228 states. [2019-12-27 16:34:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34228 states to 34228 states and 122722 transitions. [2019-12-27 16:34:16,102 INFO L78 Accepts]: Start accepts. Automaton has 34228 states and 122722 transitions. Word has length 42 [2019-12-27 16:34:16,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:16,102 INFO L462 AbstractCegarLoop]: Abstraction has 34228 states and 122722 transitions. [2019-12-27 16:34:16,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:34:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand 34228 states and 122722 transitions. [2019-12-27 16:34:16,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 16:34:16,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:16,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:16,154 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:16,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:16,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1574516846, now seen corresponding path program 2 times [2019-12-27 16:34:16,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:16,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638787368] [2019-12-27 16:34:16,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:16,214 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:34:16,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638787368] [2019-12-27 16:34:16,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:16,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:34:16,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [577721617] [2019-12-27 16:34:16,216 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:16,224 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:16,269 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 193 transitions. [2019-12-27 16:34:16,269 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:16,280 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:34:16,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:34:16,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:16,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:34:16,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:34:16,281 INFO L87 Difference]: Start difference. First operand 34228 states and 122722 transitions. Second operand 4 states. [2019-12-27 16:34:16,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:16,894 INFO L93 Difference]: Finished difference Result 58013 states and 200152 transitions. [2019-12-27 16:34:16,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:34:16,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 16:34:16,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:16,965 INFO L225 Difference]: With dead ends: 58013 [2019-12-27 16:34:16,965 INFO L226 Difference]: Without dead ends: 41467 [2019-12-27 16:34:16,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:34:17,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41467 states. [2019-12-27 16:34:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41467 to 32918. [2019-12-27 16:34:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32918 states. [2019-12-27 16:34:17,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32918 states to 32918 states and 103369 transitions. [2019-12-27 16:34:17,552 INFO L78 Accepts]: Start accepts. Automaton has 32918 states and 103369 transitions. Word has length 42 [2019-12-27 16:34:17,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:17,552 INFO L462 AbstractCegarLoop]: Abstraction has 32918 states and 103369 transitions. [2019-12-27 16:34:17,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:34:17,552 INFO L276 IsEmpty]: Start isEmpty. Operand 32918 states and 103369 transitions. [2019-12-27 16:34:17,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 16:34:17,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:17,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:17,601 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:17,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:17,601 INFO L82 PathProgramCache]: Analyzing trace with hash 730447546, now seen corresponding path program 1 times [2019-12-27 16:34:17,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:17,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820724024] [2019-12-27 16:34:17,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:17,692 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:34:17,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820724024] [2019-12-27 16:34:17,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:17,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:34:17,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1724730588] [2019-12-27 16:34:17,693 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:17,703 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:17,798 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 261 transitions. [2019-12-27 16:34:17,798 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:17,846 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:34:17,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:34:17,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:17,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:34:17,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:34:17,847 INFO L87 Difference]: Start difference. First operand 32918 states and 103369 transitions. Second operand 8 states. [2019-12-27 16:34:18,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:18,183 INFO L93 Difference]: Finished difference Result 31435 states and 99570 transitions. [2019-12-27 16:34:18,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:34:18,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-12-27 16:34:18,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:18,213 INFO L225 Difference]: With dead ends: 31435 [2019-12-27 16:34:18,213 INFO L226 Difference]: Without dead ends: 13694 [2019-12-27 16:34:18,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:34:18,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13694 states. [2019-12-27 16:34:18,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13694 to 12694. [2019-12-27 16:34:18,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12694 states. [2019-12-27 16:34:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12694 states to 12694 states and 40149 transitions. [2019-12-27 16:34:18,521 INFO L78 Accepts]: Start accepts. Automaton has 12694 states and 40149 transitions. Word has length 43 [2019-12-27 16:34:18,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:18,521 INFO L462 AbstractCegarLoop]: Abstraction has 12694 states and 40149 transitions. [2019-12-27 16:34:18,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:34:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 12694 states and 40149 transitions. [2019-12-27 16:34:18,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:18,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:18,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:18,537 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:18,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:18,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1417173482, now seen corresponding path program 1 times [2019-12-27 16:34:18,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:18,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930463650] [2019-12-27 16:34:18,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:18,596 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:34:18,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930463650] [2019-12-27 16:34:18,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:18,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:34:18,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [464339828] [2019-12-27 16:34:18,597 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:18,615 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:19,026 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 354 states and 625 transitions. [2019-12-27 16:34:19,026 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:19,028 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:34:19,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:34:19,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:19,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:34:19,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:34:19,029 INFO L87 Difference]: Start difference. First operand 12694 states and 40149 transitions. Second operand 3 states. [2019-12-27 16:34:19,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:19,132 INFO L93 Difference]: Finished difference Result 15372 states and 47564 transitions. [2019-12-27 16:34:19,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:34:19,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 16:34:19,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:19,153 INFO L225 Difference]: With dead ends: 15372 [2019-12-27 16:34:19,153 INFO L226 Difference]: Without dead ends: 15372 [2019-12-27 16:34:19,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:34:19,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15372 states. [2019-12-27 16:34:19,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15372 to 11215. [2019-12-27 16:34:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11215 states. [2019-12-27 16:34:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11215 states to 11215 states and 34889 transitions. [2019-12-27 16:34:19,365 INFO L78 Accepts]: Start accepts. Automaton has 11215 states and 34889 transitions. Word has length 57 [2019-12-27 16:34:19,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:19,365 INFO L462 AbstractCegarLoop]: Abstraction has 11215 states and 34889 transitions. [2019-12-27 16:34:19,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:34:19,365 INFO L276 IsEmpty]: Start isEmpty. Operand 11215 states and 34889 transitions. [2019-12-27 16:34:19,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:19,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:19,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:19,378 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:19,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:19,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1774753707, now seen corresponding path program 1 times [2019-12-27 16:34:19,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:19,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208236255] [2019-12-27 16:34:19,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:19,506 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:34:19,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208236255] [2019-12-27 16:34:19,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:19,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:34:19,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [864384402] [2019-12-27 16:34:19,510 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:19,523 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:19,949 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 354 states and 625 transitions. [2019-12-27 16:34:19,949 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:19,952 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:34:19,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:34:19,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:19,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:34:19,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:34:19,955 INFO L87 Difference]: Start difference. First operand 11215 states and 34889 transitions. Second operand 7 states. [2019-12-27 16:34:20,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:20,379 INFO L93 Difference]: Finished difference Result 34317 states and 105832 transitions. [2019-12-27 16:34:20,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:34:20,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 16:34:20,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:20,419 INFO L225 Difference]: With dead ends: 34317 [2019-12-27 16:34:20,419 INFO L226 Difference]: Without dead ends: 25573 [2019-12-27 16:34:20,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:34:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25573 states. [2019-12-27 16:34:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25573 to 14821. [2019-12-27 16:34:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14821 states. [2019-12-27 16:34:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14821 states to 14821 states and 46388 transitions. [2019-12-27 16:34:20,751 INFO L78 Accepts]: Start accepts. Automaton has 14821 states and 46388 transitions. Word has length 57 [2019-12-27 16:34:20,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:20,751 INFO L462 AbstractCegarLoop]: Abstraction has 14821 states and 46388 transitions. [2019-12-27 16:34:20,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:34:20,751 INFO L276 IsEmpty]: Start isEmpty. Operand 14821 states and 46388 transitions. [2019-12-27 16:34:20,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:20,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:20,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:20,768 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:20,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:20,768 INFO L82 PathProgramCache]: Analyzing trace with hash -70014025, now seen corresponding path program 2 times [2019-12-27 16:34:20,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:20,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85666885] [2019-12-27 16:34:20,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:20,855 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:34:20,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85666885] [2019-12-27 16:34:20,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:20,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:34:20,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1636826836] [2019-12-27 16:34:20,856 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:20,875 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:21,232 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 350 states and 684 transitions. [2019-12-27 16:34:21,233 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:21,432 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 16:34:21,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:34:21,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:21,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:34:21,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:34:21,433 INFO L87 Difference]: Start difference. First operand 14821 states and 46388 transitions. Second operand 9 states. [2019-12-27 16:34:24,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:24,005 INFO L93 Difference]: Finished difference Result 86558 states and 266074 transitions. [2019-12-27 16:34:24,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 16:34:24,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 16:34:24,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:24,110 INFO L225 Difference]: With dead ends: 86558 [2019-12-27 16:34:24,111 INFO L226 Difference]: Without dead ends: 62022 [2019-12-27 16:34:24,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=320, Invalid=1012, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 16:34:24,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62022 states. [2019-12-27 16:34:24,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62022 to 23426. [2019-12-27 16:34:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23426 states. [2019-12-27 16:34:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23426 states to 23426 states and 73779 transitions. [2019-12-27 16:34:24,856 INFO L78 Accepts]: Start accepts. Automaton has 23426 states and 73779 transitions. Word has length 57 [2019-12-27 16:34:24,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:24,856 INFO L462 AbstractCegarLoop]: Abstraction has 23426 states and 73779 transitions. [2019-12-27 16:34:24,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:34:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand 23426 states and 73779 transitions. [2019-12-27 16:34:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:24,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:24,886 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:24,887 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:24,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:24,887 INFO L82 PathProgramCache]: Analyzing trace with hash -766414125, now seen corresponding path program 3 times [2019-12-27 16:34:24,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:24,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073100988] [2019-12-27 16:34:24,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:24,968 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:34:24,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073100988] [2019-12-27 16:34:24,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:24,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:34:24,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [23735321] [2019-12-27 16:34:24,969 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:24,986 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:25,408 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 316 states and 595 transitions. [2019-12-27 16:34:25,409 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:25,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 16:34:25,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:34:25,863 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-12-27 16:34:25,886 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 16:34:25,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:34:25,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:25,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:34:25,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:34:25,887 INFO L87 Difference]: Start difference. First operand 23426 states and 73779 transitions. Second operand 12 states. [2019-12-27 16:34:28,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:28,849 INFO L93 Difference]: Finished difference Result 71038 states and 217598 transitions. [2019-12-27 16:34:28,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 16:34:28,849 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-27 16:34:28,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:28,962 INFO L225 Difference]: With dead ends: 71038 [2019-12-27 16:34:28,962 INFO L226 Difference]: Without dead ends: 65932 [2019-12-27 16:34:28,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=213, Invalid=779, Unknown=0, NotChecked=0, Total=992 [2019-12-27 16:34:29,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65932 states. [2019-12-27 16:34:29,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65932 to 23483. [2019-12-27 16:34:29,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23483 states. [2019-12-27 16:34:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23483 states to 23483 states and 73972 transitions. [2019-12-27 16:34:29,945 INFO L78 Accepts]: Start accepts. Automaton has 23483 states and 73972 transitions. Word has length 57 [2019-12-27 16:34:29,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:29,945 INFO L462 AbstractCegarLoop]: Abstraction has 23483 states and 73972 transitions. [2019-12-27 16:34:29,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:34:29,945 INFO L276 IsEmpty]: Start isEmpty. Operand 23483 states and 73972 transitions. [2019-12-27 16:34:29,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:29,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:29,974 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:29,974 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:29,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1430783653, now seen corresponding path program 1 times [2019-12-27 16:34:29,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:29,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983621864] [2019-12-27 16:34:29,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:30,041 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:34:30,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983621864] [2019-12-27 16:34:30,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:30,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:34:30,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1506177146] [2019-12-27 16:34:30,042 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:30,075 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:30,347 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 292 states and 547 transitions. [2019-12-27 16:34:30,347 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:30,368 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:34:30,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:34:30,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:30,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:34:30,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:34:30,369 INFO L87 Difference]: Start difference. First operand 23483 states and 73972 transitions. Second operand 3 states. [2019-12-27 16:34:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:30,486 INFO L93 Difference]: Finished difference Result 25041 states and 76723 transitions. [2019-12-27 16:34:30,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:34:30,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 16:34:30,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:30,525 INFO L225 Difference]: With dead ends: 25041 [2019-12-27 16:34:30,525 INFO L226 Difference]: Without dead ends: 25041 [2019-12-27 16:34:30,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 2 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:34:30,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25041 states. [2019-12-27 16:34:30,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25041 to 19175. [2019-12-27 16:34:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19175 states. [2019-12-27 16:34:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19175 states to 19175 states and 59124 transitions. [2019-12-27 16:34:30,857 INFO L78 Accepts]: Start accepts. Automaton has 19175 states and 59124 transitions. Word has length 57 [2019-12-27 16:34:30,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:30,858 INFO L462 AbstractCegarLoop]: Abstraction has 19175 states and 59124 transitions. [2019-12-27 16:34:30,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:34:30,858 INFO L276 IsEmpty]: Start isEmpty. Operand 19175 states and 59124 transitions. [2019-12-27 16:34:30,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:30,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:30,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:30,879 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:30,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:30,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1904135869, now seen corresponding path program 4 times [2019-12-27 16:34:30,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:30,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589859581] [2019-12-27 16:34:30,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:30,950 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:34:30,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589859581] [2019-12-27 16:34:30,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:30,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:34:30,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1652215846] [2019-12-27 16:34:30,952 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:30,968 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:31,350 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 325 states and 627 transitions. [2019-12-27 16:34:31,350 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:31,405 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 16:34:31,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:34:31,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:31,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:34:31,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:34:31,406 INFO L87 Difference]: Start difference. First operand 19175 states and 59124 transitions. Second operand 7 states. [2019-12-27 16:34:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:31,775 INFO L93 Difference]: Finished difference Result 37600 states and 112477 transitions. [2019-12-27 16:34:31,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 16:34:31,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 16:34:31,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:31,840 INFO L225 Difference]: With dead ends: 37600 [2019-12-27 16:34:31,840 INFO L226 Difference]: Without dead ends: 31952 [2019-12-27 16:34:31,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:34:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31952 states. [2019-12-27 16:34:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31952 to 19385. [2019-12-27 16:34:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19385 states. [2019-12-27 16:34:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19385 states to 19385 states and 59711 transitions. [2019-12-27 16:34:32,261 INFO L78 Accepts]: Start accepts. Automaton has 19385 states and 59711 transitions. Word has length 57 [2019-12-27 16:34:32,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:32,261 INFO L462 AbstractCegarLoop]: Abstraction has 19385 states and 59711 transitions. [2019-12-27 16:34:32,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:34:32,261 INFO L276 IsEmpty]: Start isEmpty. Operand 19385 states and 59711 transitions. [2019-12-27 16:34:32,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:32,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:32,283 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:32,283 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:32,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:32,284 INFO L82 PathProgramCache]: Analyzing trace with hash -576788017, now seen corresponding path program 5 times [2019-12-27 16:34:32,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:32,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972561115] [2019-12-27 16:34:32,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:32,368 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:34:32,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972561115] [2019-12-27 16:34:32,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:32,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:34:32,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [358523437] [2019-12-27 16:34:32,369 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:32,389 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:32,711 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 380 states and 679 transitions. [2019-12-27 16:34:32,711 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:32,950 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:34:32,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:34:32,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:32,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:34:32,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:34:32,951 INFO L87 Difference]: Start difference. First operand 19385 states and 59711 transitions. Second operand 8 states. [2019-12-27 16:34:33,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:33,841 INFO L93 Difference]: Finished difference Result 33973 states and 100988 transitions. [2019-12-27 16:34:33,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:34:33,841 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-27 16:34:33,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:33,888 INFO L225 Difference]: With dead ends: 33973 [2019-12-27 16:34:33,889 INFO L226 Difference]: Without dead ends: 33847 [2019-12-27 16:34:33,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:34:33,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33847 states. [2019-12-27 16:34:34,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33847 to 22571. [2019-12-27 16:34:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22571 states. [2019-12-27 16:34:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22571 states to 22571 states and 69083 transitions. [2019-12-27 16:34:34,345 INFO L78 Accepts]: Start accepts. Automaton has 22571 states and 69083 transitions. Word has length 57 [2019-12-27 16:34:34,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:34,345 INFO L462 AbstractCegarLoop]: Abstraction has 22571 states and 69083 transitions. [2019-12-27 16:34:34,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:34:34,345 INFO L276 IsEmpty]: Start isEmpty. Operand 22571 states and 69083 transitions. [2019-12-27 16:34:34,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:34,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:34,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, 1, 1, 1, 1] [2019-12-27 16:34:34,369 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:34,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:34,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1952605815, now seen corresponding path program 6 times [2019-12-27 16:34:34,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:34,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902939777] [2019-12-27 16:34:34,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:34,528 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:34:34,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902939777] [2019-12-27 16:34:34,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:34,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:34:34,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [209938110] [2019-12-27 16:34:34,529 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:34,546 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:34,822 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 242 states and 395 transitions. [2019-12-27 16:34:34,822 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:35,006 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 16:34:35,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:34:35,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:35,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:34:35,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:34:35,008 INFO L87 Difference]: Start difference. First operand 22571 states and 69083 transitions. Second operand 13 states. [2019-12-27 16:34:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:39,816 INFO L93 Difference]: Finished difference Result 63409 states and 190430 transitions. [2019-12-27 16:34:39,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 16:34:39,816 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 16:34:39,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:39,915 INFO L225 Difference]: With dead ends: 63409 [2019-12-27 16:34:39,915 INFO L226 Difference]: Without dead ends: 63409 [2019-12-27 16:34:39,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=394, Invalid=2156, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 16:34:40,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63409 states. [2019-12-27 16:34:40,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63409 to 30718. [2019-12-27 16:34:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30718 states. [2019-12-27 16:34:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30718 states to 30718 states and 94108 transitions. [2019-12-27 16:34:40,700 INFO L78 Accepts]: Start accepts. Automaton has 30718 states and 94108 transitions. Word has length 57 [2019-12-27 16:34:40,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:40,700 INFO L462 AbstractCegarLoop]: Abstraction has 30718 states and 94108 transitions. [2019-12-27 16:34:40,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:34:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 30718 states and 94108 transitions. [2019-12-27 16:34:40,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:40,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:40,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:40,737 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:40,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:40,737 INFO L82 PathProgramCache]: Analyzing trace with hash 2126429955, now seen corresponding path program 7 times [2019-12-27 16:34:40,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:40,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613093261] [2019-12-27 16:34:40,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:40,895 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:34:40,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613093261] [2019-12-27 16:34:40,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:40,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:34:40,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1544331346] [2019-12-27 16:34:40,897 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:40,920 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:41,518 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 433 states and 781 transitions. [2019-12-27 16:34:41,518 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:41,715 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:34:41,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:34:41,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:41,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:34:41,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:34:41,717 INFO L87 Difference]: Start difference. First operand 30718 states and 94108 transitions. Second operand 14 states. [2019-12-27 16:34:46,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:46,604 INFO L93 Difference]: Finished difference Result 80769 states and 238600 transitions. [2019-12-27 16:34:46,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 16:34:46,604 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-27 16:34:46,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:46,727 INFO L225 Difference]: With dead ends: 80769 [2019-12-27 16:34:46,727 INFO L226 Difference]: Without dead ends: 80769 [2019-12-27 16:34:46,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=573, Invalid=3209, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 16:34:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80769 states. [2019-12-27 16:34:47,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80769 to 35374. [2019-12-27 16:34:47,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35374 states. [2019-12-27 16:34:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35374 states to 35374 states and 107576 transitions. [2019-12-27 16:34:47,993 INFO L78 Accepts]: Start accepts. Automaton has 35374 states and 107576 transitions. Word has length 57 [2019-12-27 16:34:47,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:47,993 INFO L462 AbstractCegarLoop]: Abstraction has 35374 states and 107576 transitions. [2019-12-27 16:34:47,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:34:47,993 INFO L276 IsEmpty]: Start isEmpty. Operand 35374 states and 107576 transitions. [2019-12-27 16:34:48,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:48,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:48,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:48,037 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:48,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:48,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1809878711, now seen corresponding path program 8 times [2019-12-27 16:34:48,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:48,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442994833] [2019-12-27 16:34:48,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:48,209 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:34:48,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442994833] [2019-12-27 16:34:48,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:48,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:34:48,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1988985353] [2019-12-27 16:34:48,210 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:48,226 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:48,658 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 343 states and 570 transitions. [2019-12-27 16:34:48,658 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:49,661 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-27 16:34:49,662 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 16:34:49,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 16:34:49,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:49,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 16:34:49,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2019-12-27 16:34:49,663 INFO L87 Difference]: Start difference. First operand 35374 states and 107576 transitions. Second operand 22 states. [2019-12-27 16:34:51,131 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-12-27 16:34:51,433 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-12-27 16:34:53,464 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 16:34:56,184 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-27 16:34:57,029 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-27 16:34:57,772 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-27 16:34:59,305 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-27 16:35:01,596 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 16:35:02,279 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 16:35:02,638 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-27 16:35:03,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:35:03,759 INFO L93 Difference]: Finished difference Result 88628 states and 259246 transitions. [2019-12-27 16:35:03,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-12-27 16:35:03,760 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2019-12-27 16:35:03,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:35:03,895 INFO L225 Difference]: With dead ends: 88628 [2019-12-27 16:35:03,895 INFO L226 Difference]: Without dead ends: 88237 [2019-12-27 16:35:03,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4247 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=2218, Invalid=10438, Unknown=0, NotChecked=0, Total=12656 [2019-12-27 16:35:04,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88237 states. [2019-12-27 16:35:05,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88237 to 39084. [2019-12-27 16:35:05,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39084 states. [2019-12-27 16:35:05,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39084 states to 39084 states and 117105 transitions. [2019-12-27 16:35:05,103 INFO L78 Accepts]: Start accepts. Automaton has 39084 states and 117105 transitions. Word has length 57 [2019-12-27 16:35:05,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:35:05,103 INFO L462 AbstractCegarLoop]: Abstraction has 39084 states and 117105 transitions. [2019-12-27 16:35:05,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 16:35:05,103 INFO L276 IsEmpty]: Start isEmpty. Operand 39084 states and 117105 transitions. [2019-12-27 16:35:05,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:35:05,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:35:05,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:35:05,146 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:35:05,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:35:05,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1326524261, now seen corresponding path program 9 times [2019-12-27 16:35:05,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:35:05,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468993230] [2019-12-27 16:35:05,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:35:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:35:05,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:35:05,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468993230] [2019-12-27 16:35:05,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:35:05,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 16:35:05,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [682110045] [2019-12-27 16:35:05,332 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:35:05,346 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:35:06,057 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 386 states and 665 transitions. [2019-12-27 16:35:06,057 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:35:06,374 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 16:35:06,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 16:35:06,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:35:06,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 16:35:06,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2019-12-27 16:35:06,376 INFO L87 Difference]: Start difference. First operand 39084 states and 117105 transitions. Second operand 19 states. [2019-12-27 16:35:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:35:13,958 INFO L93 Difference]: Finished difference Result 105536 states and 308424 transitions. [2019-12-27 16:35:13,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-12-27 16:35:13,958 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-12-27 16:35:13,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:35:14,119 INFO L225 Difference]: With dead ends: 105536 [2019-12-27 16:35:14,119 INFO L226 Difference]: Without dead ends: 105347 [2019-12-27 16:35:14,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3090 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1400, Invalid=7912, Unknown=0, NotChecked=0, Total=9312 [2019-12-27 16:35:14,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105347 states. [2019-12-27 16:35:15,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105347 to 41796. [2019-12-27 16:35:15,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41796 states. [2019-12-27 16:35:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41796 states to 41796 states and 125163 transitions. [2019-12-27 16:35:15,264 INFO L78 Accepts]: Start accepts. Automaton has 41796 states and 125163 transitions. Word has length 57 [2019-12-27 16:35:15,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:35:15,265 INFO L462 AbstractCegarLoop]: Abstraction has 41796 states and 125163 transitions. [2019-12-27 16:35:15,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 16:35:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand 41796 states and 125163 transitions. [2019-12-27 16:35:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:35:15,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:35:15,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:35:15,310 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:35:15,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:35:15,310 INFO L82 PathProgramCache]: Analyzing trace with hash 99843907, now seen corresponding path program 10 times [2019-12-27 16:35:15,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:35:15,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937165457] [2019-12-27 16:35:15,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:35:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:35:15,530 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:35:15,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937165457] [2019-12-27 16:35:15,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:35:15,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:35:15,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [143278933] [2019-12-27 16:35:15,531 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:35:15,550 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:35:16,205 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 348 states and 578 transitions. [2019-12-27 16:35:16,206 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:35:16,588 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 16:35:16,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 16:35:16,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:35:16,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 16:35:16,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-27 16:35:16,589 INFO L87 Difference]: Start difference. First operand 41796 states and 125163 transitions. Second operand 17 states. [2019-12-27 16:35:26,679 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 16:35:31,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:35:31,102 INFO L93 Difference]: Finished difference Result 139597 states and 408196 transitions. [2019-12-27 16:35:31,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-12-27 16:35:31,102 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2019-12-27 16:35:31,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:35:31,323 INFO L225 Difference]: With dead ends: 139597 [2019-12-27 16:35:31,323 INFO L226 Difference]: Without dead ends: 139417 [2019-12-27 16:35:31,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9248 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=3270, Invalid=19682, Unknown=0, NotChecked=0, Total=22952 [2019-12-27 16:35:31,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139417 states. Received shutdown request... [2019-12-27 16:35:33,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139417 to 43005. [2019-12-27 16:35:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43005 states. [2019-12-27 16:35:33,095 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 16:35:33,099 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 16:35:33,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:35:33 BasicIcfg [2019-12-27 16:35:33,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:35:33,101 INFO L168 Benchmark]: Toolchain (without parser) took 213364.35 ms. Allocated memory was 144.7 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 99.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2019-12-27 16:35:33,101 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 16:35:33,102 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.30 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 99.3 MB in the beginning and 155.5 MB in the end (delta: -56.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:35:33,102 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.75 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:35:33,103 INFO L168 Benchmark]: Boogie Preprocessor took 45.27 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 150.8 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:35:33,103 INFO L168 Benchmark]: RCFGBuilder took 859.53 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 101.7 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:35:33,104 INFO L168 Benchmark]: TraceAbstraction took 211603.69 ms. Allocated memory was 202.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.1 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2019-12-27 16:35:33,106 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 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 790.30 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 99.3 MB in the beginning and 155.5 MB in the end (delta: -56.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.75 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.27 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 150.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 859.53 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 101.7 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 211603.69 ms. Allocated memory was 202.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.1 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 180 ProgramPointsBefore, 90 ProgramPointsAfterwards, 208 TransitionsBefore, 97 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 7595 VarBasedMoverChecksPositive, 274 VarBasedMoverChecksNegative, 123 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 74757 CheckedPairsTotal, 121 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: TIMEOUT, OverallTime: 211.3s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 92.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6176 SDtfs, 14908 SDslu, 23728 SDs, 0 SdLazy, 26604 SolverSat, 1809 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 920 GetRequests, 245 SyntacticMatches, 48 SemanticMatches, 627 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19080 ImplicationChecksByTransitivity, 23.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235278occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 60.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 469935 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 956 NumberOfCodeBlocks, 956 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 933 ConstructedInterpolants, 0 QuantifiedInterpolants, 186639 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown