/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:02:05,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:02:05,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:02:05,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:02:05,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:02:05,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:02:05,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:02:05,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:02:05,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:02:05,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:02:05,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:02:05,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:02:05,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:02:05,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:02:05,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:02:05,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:02:05,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:02:05,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:02:05,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:02:05,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:02:05,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:02:05,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:02:05,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:02:05,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:02:05,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:02:05,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:02:05,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:02:05,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:02:05,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:02:05,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:02:05,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:02:05,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:02:05,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:02:05,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:02:05,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:02:05,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:02:05,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:02:05,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:02:05,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:02:05,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:02:05,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:02:05,474 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:02:05,489 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:02:05,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:02:05,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:02:05,491 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:02:05,491 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:02:05,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:02:05,491 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:02:05,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:02:05,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:02:05,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:02:05,492 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:02:05,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:02:05,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:02:05,492 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:02:05,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:02:05,493 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:02:05,493 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:02:05,493 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:02:05,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:02:05,494 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:02:05,494 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:02:05,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:02:05,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:02:05,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:02:05,495 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:02:05,495 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:02:05,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:02:05,495 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:02:05,496 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:02:05,496 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:02:05,496 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:02:05,783 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:02:05,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:02:05,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:02:05,811 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:02:05,812 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:02:05,813 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.oepc.i [2019-12-27 16:02:05,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a2591b66/25cfcda041294a1abb7b234bc9720248/FLAG35dc357c3 [2019-12-27 16:02:06,452 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:02:06,453 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_pso.oepc.i [2019-12-27 16:02:06,467 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a2591b66/25cfcda041294a1abb7b234bc9720248/FLAG35dc357c3 [2019-12-27 16:02:06,706 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a2591b66/25cfcda041294a1abb7b234bc9720248 [2019-12-27 16:02:06,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:02:06,718 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:02:06,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:02:06,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:02:06,723 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:02:06,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:02:06" (1/1) ... [2019-12-27 16:02:06,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8a5782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:06, skipping insertion in model container [2019-12-27 16:02:06,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:02:06" (1/1) ... [2019-12-27 16:02:06,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:02:06,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:02:07,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:02:07,488 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:02:07,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:02:07,620 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:02:07,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:07 WrapperNode [2019-12-27 16:02:07,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:02:07,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:02:07,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:02:07,622 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:02:07,631 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:02:07" (1/1) ... [2019-12-27 16:02:07,654 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:02:07" (1/1) ... [2019-12-27 16:02:07,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:02:07,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:02:07,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:02:07,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:02:07,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:07" (1/1) ... [2019-12-27 16:02:07,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:07" (1/1) ... [2019-12-27 16:02:07,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:07" (1/1) ... [2019-12-27 16:02:07,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:07" (1/1) ... [2019-12-27 16:02:07,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:07" (1/1) ... [2019-12-27 16:02:07,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:07" (1/1) ... [2019-12-27 16:02:07,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:07" (1/1) ... [2019-12-27 16:02:07,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:02:07,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:02:07,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:02:07,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:02:07,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:07" (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:02:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:02:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:02:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:02:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:02:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:02:07,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:02:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:02:07,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:02:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:02:07,817 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:02:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:02:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:02:07,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:02:07,820 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:02:08,789 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:02:08,790 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:02:08,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:02:08 BoogieIcfgContainer [2019-12-27 16:02:08,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:02:08,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:02:08,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:02:08,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:02:08,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:02:06" (1/3) ... [2019-12-27 16:02:08,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5d2b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:02:08, skipping insertion in model container [2019-12-27 16:02:08,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:07" (2/3) ... [2019-12-27 16:02:08,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5d2b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:02:08, skipping insertion in model container [2019-12-27 16:02:08,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:02:08" (3/3) ... [2019-12-27 16:02:08,802 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_pso.oepc.i [2019-12-27 16:02:08,813 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:02:08,813 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:02:08,823 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:02:08,824 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:02:08,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,866 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,866 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,867 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,867 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,868 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,876 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,876 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,903 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,904 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,940 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,942 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,950 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,950 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,950 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,952 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,952 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:08,971 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:02:08,992 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:02:08,993 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:02:08,993 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:02:08,993 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:02:08,993 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:02:08,993 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:02:08,993 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:02:08,994 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:02:09,018 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 16:02:09,020 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 16:02:09,146 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 16:02:09,147 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:02:09,166 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:02:09,189 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 16:02:09,254 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 16:02:09,254 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:02:09,262 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:02:09,282 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:02:09,284 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:02:13,968 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-12-27 16:02:14,094 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-12-27 16:02:14,343 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 16:02:14,461 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 16:02:14,487 INFO L206 etLargeBlockEncoding]: Checked pairs total: 89688 [2019-12-27 16:02:14,487 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 16:02:14,491 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-27 16:02:29,252 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106864 states. [2019-12-27 16:02:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 106864 states. [2019-12-27 16:02:29,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:02:29,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:29,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:02:29,261 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:30,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:30,438 INFO L82 PathProgramCache]: Analyzing trace with hash 921701, now seen corresponding path program 1 times [2019-12-27 16:02:30,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:30,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501469588] [2019-12-27 16:02:30,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:30,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501469588] [2019-12-27 16:02:30,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:30,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:02:30,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [251902058] [2019-12-27 16:02:30,671 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:30,674 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:30,683 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:02:30,684 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:30,687 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:30,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:02:30,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:30,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:02:30,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:30,701 INFO L87 Difference]: Start difference. First operand 106864 states. Second operand 3 states. [2019-12-27 16:02:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:31,688 INFO L93 Difference]: Finished difference Result 106034 states and 453004 transitions. [2019-12-27 16:02:31,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:31,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:02:31,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:35,150 INFO L225 Difference]: With dead ends: 106034 [2019-12-27 16:02:35,151 INFO L226 Difference]: Without dead ends: 99950 [2019-12-27 16:02:35,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:40,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99950 states. [2019-12-27 16:02:42,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99950 to 99950. [2019-12-27 16:02:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99950 states. [2019-12-27 16:02:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99950 states to 99950 states and 426445 transitions. [2019-12-27 16:02:42,970 INFO L78 Accepts]: Start accepts. Automaton has 99950 states and 426445 transitions. Word has length 3 [2019-12-27 16:02:42,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:42,970 INFO L462 AbstractCegarLoop]: Abstraction has 99950 states and 426445 transitions. [2019-12-27 16:02:42,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:02:42,970 INFO L276 IsEmpty]: Start isEmpty. Operand 99950 states and 426445 transitions. [2019-12-27 16:02:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:02:42,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:42,974 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:42,975 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:42,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:42,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1680645281, now seen corresponding path program 1 times [2019-12-27 16:02:42,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:42,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100662902] [2019-12-27 16:02:42,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:43,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100662902] [2019-12-27 16:02:43,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:43,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:02:43,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1359654165] [2019-12-27 16:02:43,103 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:43,104 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:43,107 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:02:43,108 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:43,108 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:43,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:02:43,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:43,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:02:43,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:02:43,110 INFO L87 Difference]: Start difference. First operand 99950 states and 426445 transitions. Second operand 4 states. [2019-12-27 16:02:47,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:47,405 INFO L93 Difference]: Finished difference Result 159384 states and 652094 transitions. [2019-12-27 16:02:47,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:02:47,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:02:47,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:48,515 INFO L225 Difference]: With dead ends: 159384 [2019-12-27 16:02:48,516 INFO L226 Difference]: Without dead ends: 159335 [2019-12-27 16:02:48,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:53,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159335 states. [2019-12-27 16:02:56,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159335 to 143879. [2019-12-27 16:02:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143879 states. [2019-12-27 16:03:04,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143879 states to 143879 states and 597281 transitions. [2019-12-27 16:03:04,262 INFO L78 Accepts]: Start accepts. Automaton has 143879 states and 597281 transitions. Word has length 11 [2019-12-27 16:03:04,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:04,263 INFO L462 AbstractCegarLoop]: Abstraction has 143879 states and 597281 transitions. [2019-12-27 16:03:04,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:03:04,263 INFO L276 IsEmpty]: Start isEmpty. Operand 143879 states and 597281 transitions. [2019-12-27 16:03:04,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:03:04,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:04,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:03:04,270 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:04,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:04,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1535099311, now seen corresponding path program 1 times [2019-12-27 16:03:04,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:04,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083894526] [2019-12-27 16:03:04,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:04,407 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:03:04,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083894526] [2019-12-27 16:03:04,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:04,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:03:04,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [547643173] [2019-12-27 16:03:04,414 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:04,415 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:04,418 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:03:04,418 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:04,418 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:03:04,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:03:04,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:04,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:03:04,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:03:04,419 INFO L87 Difference]: Start difference. First operand 143879 states and 597281 transitions. Second operand 4 states. [2019-12-27 16:03:07,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:07,143 INFO L93 Difference]: Finished difference Result 202801 states and 822791 transitions. [2019-12-27 16:03:07,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:03:07,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 16:03:07,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:09,031 INFO L225 Difference]: With dead ends: 202801 [2019-12-27 16:03:09,031 INFO L226 Difference]: Without dead ends: 202745 [2019-12-27 16:03:09,032 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:03:19,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202745 states. [2019-12-27 16:03:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202745 to 170256. [2019-12-27 16:03:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170256 states. [2019-12-27 16:03:23,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170256 states to 170256 states and 703222 transitions. [2019-12-27 16:03:23,856 INFO L78 Accepts]: Start accepts. Automaton has 170256 states and 703222 transitions. Word has length 13 [2019-12-27 16:03:23,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:23,857 INFO L462 AbstractCegarLoop]: Abstraction has 170256 states and 703222 transitions. [2019-12-27 16:03:23,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:03:23,858 INFO L276 IsEmpty]: Start isEmpty. Operand 170256 states and 703222 transitions. [2019-12-27 16:03:23,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:03:23,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:23,865 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:03:23,866 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:23,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:23,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1228744872, now seen corresponding path program 1 times [2019-12-27 16:03:23,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:23,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857492509] [2019-12-27 16:03:23,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:23,982 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:03:23,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857492509] [2019-12-27 16:03:23,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:23,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:03:23,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1006553313] [2019-12-27 16:03:23,983 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:23,986 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:23,988 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:03:23,989 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:23,989 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:03:23,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:03:23,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:23,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:03:23,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:03:23,990 INFO L87 Difference]: Start difference. First operand 170256 states and 703222 transitions. Second operand 4 states. [2019-12-27 16:03:31,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:31,458 INFO L93 Difference]: Finished difference Result 214467 states and 881100 transitions. [2019-12-27 16:03:31,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:03:31,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:03:31,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:32,153 INFO L225 Difference]: With dead ends: 214467 [2019-12-27 16:03:32,153 INFO L226 Difference]: Without dead ends: 214467 [2019-12-27 16:03:32,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:03:37,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214467 states. [2019-12-27 16:03:40,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214467 to 183252. [2019-12-27 16:03:40,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183252 states. [2019-12-27 16:03:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183252 states to 183252 states and 757164 transitions. [2019-12-27 16:03:41,483 INFO L78 Accepts]: Start accepts. Automaton has 183252 states and 757164 transitions. Word has length 16 [2019-12-27 16:03:41,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:41,484 INFO L462 AbstractCegarLoop]: Abstraction has 183252 states and 757164 transitions. [2019-12-27 16:03:41,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:03:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 183252 states and 757164 transitions. [2019-12-27 16:03:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:03:41,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:41,495 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:03:41,495 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:41,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:41,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1228651655, now seen corresponding path program 1 times [2019-12-27 16:03:41,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:41,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35693695] [2019-12-27 16:03:41,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:41,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:03:41,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35693695] [2019-12-27 16:03:41,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:41,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:03:41,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [292683327] [2019-12-27 16:03:41,608 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:41,610 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:41,614 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:03:41,614 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:41,614 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:03:41,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:03:41,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:41,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:03:41,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:03:41,615 INFO L87 Difference]: Start difference. First operand 183252 states and 757164 transitions. Second operand 4 states. [2019-12-27 16:03:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:44,030 INFO L93 Difference]: Finished difference Result 223450 states and 919042 transitions. [2019-12-27 16:03:44,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:03:44,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:03:44,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:52,218 INFO L225 Difference]: With dead ends: 223450 [2019-12-27 16:03:52,218 INFO L226 Difference]: Without dead ends: 223450 [2019-12-27 16:03:52,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:03:57,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223450 states. [2019-12-27 16:04:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223450 to 182620. [2019-12-27 16:04:00,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182620 states. [2019-12-27 16:04:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182620 states to 182620 states and 754482 transitions. [2019-12-27 16:04:01,499 INFO L78 Accepts]: Start accepts. Automaton has 182620 states and 754482 transitions. Word has length 16 [2019-12-27 16:04:01,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:04:01,499 INFO L462 AbstractCegarLoop]: Abstraction has 182620 states and 754482 transitions. [2019-12-27 16:04:01,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:04:01,499 INFO L276 IsEmpty]: Start isEmpty. Operand 182620 states and 754482 transitions. [2019-12-27 16:04:01,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 16:04:01,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:04:01,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:04:01,514 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:04:01,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:04:01,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1477868963, now seen corresponding path program 1 times [2019-12-27 16:04:01,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:04:01,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249107987] [2019-12-27 16:04:01,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:04:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:04:01,565 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:04:01,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249107987] [2019-12-27 16:04:01,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:04:01,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:04:01,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1538989011] [2019-12-27 16:04:01,567 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:04:01,572 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:04:01,575 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 28 transitions. [2019-12-27 16:04:01,575 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:04:01,577 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:04:01,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:04:01,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:04:01,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:04:01,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:04:01,580 INFO L87 Difference]: Start difference. First operand 182620 states and 754482 transitions. Second operand 3 states. [2019-12-27 16:04:08,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:04:08,224 INFO L93 Difference]: Finished difference Result 182256 states and 753055 transitions. [2019-12-27 16:04:08,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:04:08,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 16:04:08,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:04:08,792 INFO L225 Difference]: With dead ends: 182256 [2019-12-27 16:04:08,792 INFO L226 Difference]: Without dead ends: 182256 [2019-12-27 16:04:08,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:04:14,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182256 states. [2019-12-27 16:04:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182256 to 182256. [2019-12-27 16:04:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182256 states. [2019-12-27 16:04:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182256 states to 182256 states and 753055 transitions. [2019-12-27 16:04:17,776 INFO L78 Accepts]: Start accepts. Automaton has 182256 states and 753055 transitions. Word has length 18 [2019-12-27 16:04:17,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:04:17,777 INFO L462 AbstractCegarLoop]: Abstraction has 182256 states and 753055 transitions. [2019-12-27 16:04:17,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:04:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 182256 states and 753055 transitions. [2019-12-27 16:04:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 16:04:17,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:04:17,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:04:17,791 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:04:17,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:04:17,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1719186322, now seen corresponding path program 1 times [2019-12-27 16:04:17,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:04:17,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609457970] [2019-12-27 16:04:17,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:04:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:04:17,861 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:04:17,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609457970] [2019-12-27 16:04:17,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:04:17,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:04:17,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1263846234] [2019-12-27 16:04:17,862 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:04:17,865 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:04:17,869 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 38 transitions. [2019-12-27 16:04:17,869 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:04:17,873 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:04:17,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:04:17,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:04:17,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:04:17,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:04:17,874 INFO L87 Difference]: Start difference. First operand 182256 states and 753055 transitions. Second operand 3 states. [2019-12-27 16:04:20,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:04:20,097 INFO L93 Difference]: Finished difference Result 171684 states and 701366 transitions. [2019-12-27 16:04:20,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:04:20,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-27 16:04:20,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:04:20,591 INFO L225 Difference]: With dead ends: 171684 [2019-12-27 16:04:20,592 INFO L226 Difference]: Without dead ends: 171684 [2019-12-27 16:04:20,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:04:31,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171684 states. [2019-12-27 16:04:34,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171684 to 168552. [2019-12-27 16:04:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168552 states. [2019-12-27 16:04:35,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168552 states to 168552 states and 689782 transitions. [2019-12-27 16:04:35,331 INFO L78 Accepts]: Start accepts. Automaton has 168552 states and 689782 transitions. Word has length 19 [2019-12-27 16:04:35,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:04:35,332 INFO L462 AbstractCegarLoop]: Abstraction has 168552 states and 689782 transitions. [2019-12-27 16:04:35,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:04:35,332 INFO L276 IsEmpty]: Start isEmpty. Operand 168552 states and 689782 transitions. [2019-12-27 16:04:35,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 16:04:35,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:04:35,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:04:35,344 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:04:35,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:04:35,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2011667091, now seen corresponding path program 1 times [2019-12-27 16:04:35,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:04:35,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319180593] [2019-12-27 16:04:35,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:04:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:04:35,446 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:04:35,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319180593] [2019-12-27 16:04:35,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:04:35,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:04:35,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1679626749] [2019-12-27 16:04:35,447 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:04:35,449 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:04:35,454 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 55 transitions. [2019-12-27 16:04:35,454 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:04:35,454 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:04:35,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:04:35,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:04:35,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:04:35,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:04:35,456 INFO L87 Difference]: Start difference. First operand 168552 states and 689782 transitions. Second operand 5 states. [2019-12-27 16:04:42,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:04:42,604 INFO L93 Difference]: Finished difference Result 249455 states and 1001464 transitions. [2019-12-27 16:04:42,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:04:42,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 16:04:42,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:04:43,346 INFO L225 Difference]: With dead ends: 249455 [2019-12-27 16:04:43,347 INFO L226 Difference]: Without dead ends: 249364 [2019-12-27 16:04:43,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:04:49,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249364 states. [2019-12-27 16:04:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249364 to 180285. [2019-12-27 16:04:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180285 states. [2019-12-27 16:04:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180285 states to 180285 states and 737390 transitions. [2019-12-27 16:04:53,768 INFO L78 Accepts]: Start accepts. Automaton has 180285 states and 737390 transitions. Word has length 19 [2019-12-27 16:04:53,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:04:53,769 INFO L462 AbstractCegarLoop]: Abstraction has 180285 states and 737390 transitions. [2019-12-27 16:04:53,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:04:53,769 INFO L276 IsEmpty]: Start isEmpty. Operand 180285 states and 737390 transitions. [2019-12-27 16:04:53,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 16:04:53,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:04:53,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:04:53,782 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:04:53,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:04:53,783 INFO L82 PathProgramCache]: Analyzing trace with hash -397421843, now seen corresponding path program 1 times [2019-12-27 16:04:53,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:04:53,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845924989] [2019-12-27 16:04:53,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:04:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:04:53,872 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:04:53,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845924989] [2019-12-27 16:04:53,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:04:53,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:04:53,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1708289951] [2019-12-27 16:04:53,875 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:04:53,879 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:04:53,883 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 25 transitions. [2019-12-27 16:04:53,884 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:04:53,887 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:04:53,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:04:53,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:04:53,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:04:53,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:04:53,888 INFO L87 Difference]: Start difference. First operand 180285 states and 737390 transitions. Second operand 4 states. [2019-12-27 16:04:54,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:04:54,244 INFO L93 Difference]: Finished difference Result 49433 states and 168883 transitions. [2019-12-27 16:04:54,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:04:54,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 16:04:54,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:04:54,353 INFO L225 Difference]: With dead ends: 49433 [2019-12-27 16:04:54,353 INFO L226 Difference]: Without dead ends: 37972 [2019-12-27 16:04:54,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:04:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37972 states. [2019-12-27 16:05:00,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37972 to 37867. [2019-12-27 16:05:00,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37867 states. [2019-12-27 16:05:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37867 states to 37867 states and 122078 transitions. [2019-12-27 16:05:00,182 INFO L78 Accepts]: Start accepts. Automaton has 37867 states and 122078 transitions. Word has length 19 [2019-12-27 16:05:00,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:00,182 INFO L462 AbstractCegarLoop]: Abstraction has 37867 states and 122078 transitions. [2019-12-27 16:05:00,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:05:00,183 INFO L276 IsEmpty]: Start isEmpty. Operand 37867 states and 122078 transitions. [2019-12-27 16:05:00,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:05:00,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:00,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:00,188 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:00,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:00,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1838789338, now seen corresponding path program 1 times [2019-12-27 16:05:00,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:00,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73130857] [2019-12-27 16:05:00,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:00,254 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:05:00,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73130857] [2019-12-27 16:05:00,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:00,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:00,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1304229758] [2019-12-27 16:05:00,255 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:00,258 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:00,266 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 16:05:00,266 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:00,266 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:00,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:05:00,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:00,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:05:00,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:05:00,268 INFO L87 Difference]: Start difference. First operand 37867 states and 122078 transitions. Second operand 5 states. [2019-12-27 16:05:00,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:00,973 INFO L93 Difference]: Finished difference Result 56067 states and 178279 transitions. [2019-12-27 16:05:00,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:05:00,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:05:00,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:01,070 INFO L225 Difference]: With dead ends: 56067 [2019-12-27 16:05:01,070 INFO L226 Difference]: Without dead ends: 56011 [2019-12-27 16:05:01,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:05:01,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56011 states. [2019-12-27 16:05:01,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56011 to 41085. [2019-12-27 16:05:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41085 states. [2019-12-27 16:05:02,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41085 states to 41085 states and 132295 transitions. [2019-12-27 16:05:02,324 INFO L78 Accepts]: Start accepts. Automaton has 41085 states and 132295 transitions. Word has length 22 [2019-12-27 16:05:02,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:02,324 INFO L462 AbstractCegarLoop]: Abstraction has 41085 states and 132295 transitions. [2019-12-27 16:05:02,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:05:02,325 INFO L276 IsEmpty]: Start isEmpty. Operand 41085 states and 132295 transitions. [2019-12-27 16:05:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:05:02,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:02,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:02,331 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:02,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:02,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1838882555, now seen corresponding path program 1 times [2019-12-27 16:05:02,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:02,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011186016] [2019-12-27 16:05:02,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:02,437 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:05:02,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011186016] [2019-12-27 16:05:02,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:02,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:02,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1961754166] [2019-12-27 16:05:02,438 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:02,441 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:02,448 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 16:05:02,449 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:02,449 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:02,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:05:02,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:02,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:05:02,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:05:02,450 INFO L87 Difference]: Start difference. First operand 41085 states and 132295 transitions. Second operand 5 states. [2019-12-27 16:05:03,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:03,071 INFO L93 Difference]: Finished difference Result 56578 states and 179826 transitions. [2019-12-27 16:05:03,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:05:03,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:05:03,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:03,166 INFO L225 Difference]: With dead ends: 56578 [2019-12-27 16:05:03,167 INFO L226 Difference]: Without dead ends: 56522 [2019-12-27 16:05:03,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:05:03,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56522 states. [2019-12-27 16:05:03,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56522 to 38683. [2019-12-27 16:05:03,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38683 states. [2019-12-27 16:05:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38683 states to 38683 states and 124370 transitions. [2019-12-27 16:05:04,007 INFO L78 Accepts]: Start accepts. Automaton has 38683 states and 124370 transitions. Word has length 22 [2019-12-27 16:05:04,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:04,008 INFO L462 AbstractCegarLoop]: Abstraction has 38683 states and 124370 transitions. [2019-12-27 16:05:04,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:05:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 38683 states and 124370 transitions. [2019-12-27 16:05:04,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:05:04,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:04,021 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] [2019-12-27 16:05:04,021 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:04,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:04,021 INFO L82 PathProgramCache]: Analyzing trace with hash 270212897, now seen corresponding path program 1 times [2019-12-27 16:05:04,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:04,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935311365] [2019-12-27 16:05:04,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:04,053 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:05:04,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935311365] [2019-12-27 16:05:04,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:04,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:04,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [199274951] [2019-12-27 16:05:04,054 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:04,059 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:04,065 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:05:04,065 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:04,066 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:04,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:05:04,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:04,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:05:04,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:05:04,067 INFO L87 Difference]: Start difference. First operand 38683 states and 124370 transitions. Second operand 3 states. [2019-12-27 16:05:04,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:04,696 INFO L93 Difference]: Finished difference Result 59121 states and 189037 transitions. [2019-12-27 16:05:04,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:05:04,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:05:04,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:04,792 INFO L225 Difference]: With dead ends: 59121 [2019-12-27 16:05:04,793 INFO L226 Difference]: Without dead ends: 59121 [2019-12-27 16:05:04,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:05:05,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59121 states. [2019-12-27 16:05:05,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59121 to 45711. [2019-12-27 16:05:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45711 states. [2019-12-27 16:05:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45711 states to 45711 states and 147221 transitions. [2019-12-27 16:05:05,622 INFO L78 Accepts]: Start accepts. Automaton has 45711 states and 147221 transitions. Word has length 27 [2019-12-27 16:05:05,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:05,622 INFO L462 AbstractCegarLoop]: Abstraction has 45711 states and 147221 transitions. [2019-12-27 16:05:05,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:05:05,622 INFO L276 IsEmpty]: Start isEmpty. Operand 45711 states and 147221 transitions. [2019-12-27 16:05:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:05:05,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:05,636 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] [2019-12-27 16:05:05,637 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:05,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:05,637 INFO L82 PathProgramCache]: Analyzing trace with hash 2064759266, now seen corresponding path program 1 times [2019-12-27 16:05:05,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:05,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489037294] [2019-12-27 16:05:05,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:05,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:05:05,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489037294] [2019-12-27 16:05:05,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:05,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:05,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1594366876] [2019-12-27 16:05:05,666 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:05,670 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:05,676 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:05:05,676 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:05,676 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:05,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:05:05,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:05,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:05:05,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:05:05,677 INFO L87 Difference]: Start difference. First operand 45711 states and 147221 transitions. Second operand 3 states. [2019-12-27 16:05:05,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:05,924 INFO L93 Difference]: Finished difference Result 59121 states and 184317 transitions. [2019-12-27 16:05:05,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:05:05,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:05:05,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:06,019 INFO L225 Difference]: With dead ends: 59121 [2019-12-27 16:05:06,019 INFO L226 Difference]: Without dead ends: 59121 [2019-12-27 16:05:06,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:05:06,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59121 states. [2019-12-27 16:05:07,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59121 to 45711. [2019-12-27 16:05:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45711 states. [2019-12-27 16:05:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45711 states to 45711 states and 142501 transitions. [2019-12-27 16:05:07,254 INFO L78 Accepts]: Start accepts. Automaton has 45711 states and 142501 transitions. Word has length 27 [2019-12-27 16:05:07,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:07,254 INFO L462 AbstractCegarLoop]: Abstraction has 45711 states and 142501 transitions. [2019-12-27 16:05:07,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:05:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 45711 states and 142501 transitions. [2019-12-27 16:05:07,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:05:07,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:07,269 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] [2019-12-27 16:05:07,269 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:07,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:07,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2010439622, now seen corresponding path program 1 times [2019-12-27 16:05:07,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:07,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34598719] [2019-12-27 16:05:07,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:07,366 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:05:07,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34598719] [2019-12-27 16:05:07,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:07,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:07,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1761939647] [2019-12-27 16:05:07,367 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:07,373 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:07,380 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:05:07,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:07,380 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:07,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:05:07,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:07,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:05:07,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:05:07,381 INFO L87 Difference]: Start difference. First operand 45711 states and 142501 transitions. Second operand 5 states. [2019-12-27 16:05:07,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:07,883 INFO L93 Difference]: Finished difference Result 56372 states and 173835 transitions. [2019-12-27 16:05:07,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:05:07,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 16:05:07,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:07,970 INFO L225 Difference]: With dead ends: 56372 [2019-12-27 16:05:07,970 INFO L226 Difference]: Without dead ends: 56196 [2019-12-27 16:05:07,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:05:08,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56196 states. [2019-12-27 16:05:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56196 to 47904. [2019-12-27 16:05:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47904 states. [2019-12-27 16:05:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47904 states to 47904 states and 149182 transitions. [2019-12-27 16:05:09,172 INFO L78 Accepts]: Start accepts. Automaton has 47904 states and 149182 transitions. Word has length 27 [2019-12-27 16:05:09,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:09,172 INFO L462 AbstractCegarLoop]: Abstraction has 47904 states and 149182 transitions. [2019-12-27 16:05:09,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:05:09,172 INFO L276 IsEmpty]: Start isEmpty. Operand 47904 states and 149182 transitions. [2019-12-27 16:05:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:05:09,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:09,189 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:05:09,189 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:09,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:09,189 INFO L82 PathProgramCache]: Analyzing trace with hash 773295241, now seen corresponding path program 1 times [2019-12-27 16:05:09,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:09,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136916845] [2019-12-27 16:05:09,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:09,275 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:05:09,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136916845] [2019-12-27 16:05:09,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:09,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:05:09,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1854402997] [2019-12-27 16:05:09,276 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:09,281 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:09,288 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 16:05:09,288 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:09,289 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:09,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:05:09,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:09,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:05:09,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:05:09,290 INFO L87 Difference]: Start difference. First operand 47904 states and 149182 transitions. Second operand 6 states. [2019-12-27 16:05:09,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:09,671 INFO L93 Difference]: Finished difference Result 60920 states and 188447 transitions. [2019-12-27 16:05:09,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:05:09,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 16:05:09,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:09,769 INFO L225 Difference]: With dead ends: 60920 [2019-12-27 16:05:09,769 INFO L226 Difference]: Without dead ends: 60920 [2019-12-27 16:05:09,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:05:10,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60920 states. [2019-12-27 16:05:11,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60920 to 49059. [2019-12-27 16:05:11,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49059 states. [2019-12-27 16:05:11,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49059 states to 49059 states and 152544 transitions. [2019-12-27 16:05:11,185 INFO L78 Accepts]: Start accepts. Automaton has 49059 states and 152544 transitions. Word has length 28 [2019-12-27 16:05:11,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:11,185 INFO L462 AbstractCegarLoop]: Abstraction has 49059 states and 152544 transitions. [2019-12-27 16:05:11,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:05:11,186 INFO L276 IsEmpty]: Start isEmpty. Operand 49059 states and 152544 transitions. [2019-12-27 16:05:11,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 16:05:11,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:11,208 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] [2019-12-27 16:05:11,208 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:11,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:11,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1192824778, now seen corresponding path program 1 times [2019-12-27 16:05:11,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:11,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294436581] [2019-12-27 16:05:11,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:11,288 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:05:11,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294436581] [2019-12-27 16:05:11,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:11,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:11,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [408683241] [2019-12-27 16:05:11,289 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:11,297 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:11,306 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 29 transitions. [2019-12-27 16:05:11,306 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:11,306 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:11,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:05:11,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:11,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:05:11,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:05:11,307 INFO L87 Difference]: Start difference. First operand 49059 states and 152544 transitions. Second operand 5 states. [2019-12-27 16:05:11,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:11,822 INFO L93 Difference]: Finished difference Result 59173 states and 181587 transitions. [2019-12-27 16:05:11,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:05:11,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 16:05:11,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:11,914 INFO L225 Difference]: With dead ends: 59173 [2019-12-27 16:05:11,915 INFO L226 Difference]: Without dead ends: 58989 [2019-12-27 16:05:11,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:05:12,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58989 states. [2019-12-27 16:05:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58989 to 48880. [2019-12-27 16:05:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48880 states. [2019-12-27 16:05:12,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48880 states to 48880 states and 151923 transitions. [2019-12-27 16:05:12,769 INFO L78 Accepts]: Start accepts. Automaton has 48880 states and 151923 transitions. Word has length 29 [2019-12-27 16:05:12,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:12,769 INFO L462 AbstractCegarLoop]: Abstraction has 48880 states and 151923 transitions. [2019-12-27 16:05:12,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:05:12,769 INFO L276 IsEmpty]: Start isEmpty. Operand 48880 states and 151923 transitions. [2019-12-27 16:05:12,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 16:05:12,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:12,785 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] [2019-12-27 16:05:12,786 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:12,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:12,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1820575072, now seen corresponding path program 1 times [2019-12-27 16:05:12,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:12,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240845751] [2019-12-27 16:05:12,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:12,862 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:05:12,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240845751] [2019-12-27 16:05:12,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:12,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:05:12,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1829105137] [2019-12-27 16:05:12,865 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:12,869 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:12,879 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 60 transitions. [2019-12-27 16:05:12,880 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:12,880 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:12,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:05:12,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:12,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:05:12,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:05:12,881 INFO L87 Difference]: Start difference. First operand 48880 states and 151923 transitions. Second operand 5 states. [2019-12-27 16:05:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:13,022 INFO L93 Difference]: Finished difference Result 21673 states and 64709 transitions. [2019-12-27 16:05:13,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:05:13,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 16:05:13,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:13,070 INFO L225 Difference]: With dead ends: 21673 [2019-12-27 16:05:13,070 INFO L226 Difference]: Without dead ends: 18985 [2019-12-27 16:05:13,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:05:13,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18985 states. [2019-12-27 16:05:13,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18985 to 17855. [2019-12-27 16:05:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17855 states. [2019-12-27 16:05:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17855 states to 17855 states and 53100 transitions. [2019-12-27 16:05:13,735 INFO L78 Accepts]: Start accepts. Automaton has 17855 states and 53100 transitions. Word has length 30 [2019-12-27 16:05:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:13,735 INFO L462 AbstractCegarLoop]: Abstraction has 17855 states and 53100 transitions. [2019-12-27 16:05:13,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:05:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 17855 states and 53100 transitions. [2019-12-27 16:05:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:05:13,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:13,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:13,752 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:13,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:13,752 INFO L82 PathProgramCache]: Analyzing trace with hash -809721720, now seen corresponding path program 1 times [2019-12-27 16:05:13,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:13,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405221201] [2019-12-27 16:05:13,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:05:13,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405221201] [2019-12-27 16:05:13,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:13,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:05:13,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1406514376] [2019-12-27 16:05:13,854 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:13,860 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:13,872 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 16:05:13,872 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:13,873 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:13,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:05:13,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:13,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:05:13,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:05:13,874 INFO L87 Difference]: Start difference. First operand 17855 states and 53100 transitions. Second operand 6 states. [2019-12-27 16:05:14,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:14,532 INFO L93 Difference]: Finished difference Result 22307 states and 65295 transitions. [2019-12-27 16:05:14,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:05:14,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 16:05:14,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:14,563 INFO L225 Difference]: With dead ends: 22307 [2019-12-27 16:05:14,563 INFO L226 Difference]: Without dead ends: 21986 [2019-12-27 16:05:14,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:05:14,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21986 states. [2019-12-27 16:05:14,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21986 to 17876. [2019-12-27 16:05:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17876 states. [2019-12-27 16:05:14,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17876 states to 17876 states and 53115 transitions. [2019-12-27 16:05:14,854 INFO L78 Accepts]: Start accepts. Automaton has 17876 states and 53115 transitions. Word has length 33 [2019-12-27 16:05:14,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:14,854 INFO L462 AbstractCegarLoop]: Abstraction has 17876 states and 53115 transitions. [2019-12-27 16:05:14,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:05:14,854 INFO L276 IsEmpty]: Start isEmpty. Operand 17876 states and 53115 transitions. [2019-12-27 16:05:14,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 16:05:14,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:14,874 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] [2019-12-27 16:05:14,874 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:14,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:14,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1243510664, now seen corresponding path program 1 times [2019-12-27 16:05:14,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:14,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046632966] [2019-12-27 16:05:14,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:14,954 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:05:14,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046632966] [2019-12-27 16:05:14,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:14,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:05:14,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1952987380] [2019-12-27 16:05:14,955 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:14,962 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:14,977 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 63 transitions. [2019-12-27 16:05:14,978 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:14,978 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:14,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:05:14,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:14,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:05:14,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:05:14,979 INFO L87 Difference]: Start difference. First operand 17876 states and 53115 transitions. Second operand 6 states. [2019-12-27 16:05:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:15,722 INFO L93 Difference]: Finished difference Result 21464 states and 62836 transitions. [2019-12-27 16:05:15,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:05:15,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-27 16:05:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:15,751 INFO L225 Difference]: With dead ends: 21464 [2019-12-27 16:05:15,751 INFO L226 Difference]: Without dead ends: 21089 [2019-12-27 16:05:15,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:05:15,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21089 states. [2019-12-27 16:05:15,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21089 to 16769. [2019-12-27 16:05:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16769 states. [2019-12-27 16:05:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16769 states to 16769 states and 49885 transitions. [2019-12-27 16:05:16,025 INFO L78 Accepts]: Start accepts. Automaton has 16769 states and 49885 transitions. Word has length 35 [2019-12-27 16:05:16,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:16,026 INFO L462 AbstractCegarLoop]: Abstraction has 16769 states and 49885 transitions. [2019-12-27 16:05:16,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:05:16,026 INFO L276 IsEmpty]: Start isEmpty. Operand 16769 states and 49885 transitions. [2019-12-27 16:05:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:05:16,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:16,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:16,042 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:16,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:16,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1200265194, now seen corresponding path program 1 times [2019-12-27 16:05:16,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:16,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404135548] [2019-12-27 16:05:16,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:16,116 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:05:16,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404135548] [2019-12-27 16:05:16,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:16,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:05:16,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1565706860] [2019-12-27 16:05:16,117 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:16,126 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:16,176 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 189 transitions. [2019-12-27 16:05:16,176 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:16,264 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:05:16,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:05:16,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:16,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:05:16,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:05:16,265 INFO L87 Difference]: Start difference. First operand 16769 states and 49885 transitions. Second operand 6 states. [2019-12-27 16:05:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:17,236 INFO L93 Difference]: Finished difference Result 24964 states and 73529 transitions. [2019-12-27 16:05:17,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:05:17,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 16:05:17,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:17,271 INFO L225 Difference]: With dead ends: 24964 [2019-12-27 16:05:17,271 INFO L226 Difference]: Without dead ends: 24964 [2019-12-27 16:05:17,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:05:17,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24964 states. [2019-12-27 16:05:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24964 to 19910. [2019-12-27 16:05:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19910 states. [2019-12-27 16:05:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19910 states to 19910 states and 59385 transitions. [2019-12-27 16:05:17,595 INFO L78 Accepts]: Start accepts. Automaton has 19910 states and 59385 transitions. Word has length 41 [2019-12-27 16:05:17,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:17,596 INFO L462 AbstractCegarLoop]: Abstraction has 19910 states and 59385 transitions. [2019-12-27 16:05:17,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:05:17,596 INFO L276 IsEmpty]: Start isEmpty. Operand 19910 states and 59385 transitions. [2019-12-27 16:05:17,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:05:17,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:17,616 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:17,616 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:17,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:17,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1472692188, now seen corresponding path program 2 times [2019-12-27 16:05:17,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:17,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188376099] [2019-12-27 16:05:17,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:17,698 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:05:17,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188376099] [2019-12-27 16:05:17,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:17,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:05:17,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [161580656] [2019-12-27 16:05:17,699 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:17,708 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:17,743 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 108 states and 187 transitions. [2019-12-27 16:05:17,744 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:17,756 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:05:17,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:05:17,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:17,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:05:17,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:05:17,758 INFO L87 Difference]: Start difference. First operand 19910 states and 59385 transitions. Second operand 6 states. [2019-12-27 16:05:17,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:17,871 INFO L93 Difference]: Finished difference Result 18544 states and 56434 transitions. [2019-12-27 16:05:17,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:05:17,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 16:05:17,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:17,899 INFO L225 Difference]: With dead ends: 18544 [2019-12-27 16:05:17,899 INFO L226 Difference]: Without dead ends: 18395 [2019-12-27 16:05:17,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:05:17,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18395 states. [2019-12-27 16:05:18,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18395 to 16868. [2019-12-27 16:05:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16868 states. [2019-12-27 16:05:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16868 states to 16868 states and 51763 transitions. [2019-12-27 16:05:18,160 INFO L78 Accepts]: Start accepts. Automaton has 16868 states and 51763 transitions. Word has length 41 [2019-12-27 16:05:18,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:18,160 INFO L462 AbstractCegarLoop]: Abstraction has 16868 states and 51763 transitions. [2019-12-27 16:05:18,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:05:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 16868 states and 51763 transitions. [2019-12-27 16:05:18,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:05:18,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:18,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:18,178 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:18,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:18,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1424537019, now seen corresponding path program 1 times [2019-12-27 16:05:18,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:18,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050804224] [2019-12-27 16:05:18,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:18,263 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:05:18,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050804224] [2019-12-27 16:05:18,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:18,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:05:18,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2050279162] [2019-12-27 16:05:18,265 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:18,287 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:18,593 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 425 transitions. [2019-12-27 16:05:18,593 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:18,609 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:05:18,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:05:18,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:18,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:05:18,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:05:18,611 INFO L87 Difference]: Start difference. First operand 16868 states and 51763 transitions. Second operand 7 states. [2019-12-27 16:05:19,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:19,351 INFO L93 Difference]: Finished difference Result 48420 states and 146954 transitions. [2019-12-27 16:05:19,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:05:19,352 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 16:05:19,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:19,400 INFO L225 Difference]: With dead ends: 48420 [2019-12-27 16:05:19,401 INFO L226 Difference]: Without dead ends: 35498 [2019-12-27 16:05:19,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:05:19,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35498 states. [2019-12-27 16:05:19,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35498 to 19884. [2019-12-27 16:05:19,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19884 states. [2019-12-27 16:05:19,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19884 states to 19884 states and 60700 transitions. [2019-12-27 16:05:19,814 INFO L78 Accepts]: Start accepts. Automaton has 19884 states and 60700 transitions. Word has length 65 [2019-12-27 16:05:19,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:19,814 INFO L462 AbstractCegarLoop]: Abstraction has 19884 states and 60700 transitions. [2019-12-27 16:05:19,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:05:19,814 INFO L276 IsEmpty]: Start isEmpty. Operand 19884 states and 60700 transitions. [2019-12-27 16:05:19,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:05:19,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:19,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:19,836 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:19,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:19,836 INFO L82 PathProgramCache]: Analyzing trace with hash 292633507, now seen corresponding path program 2 times [2019-12-27 16:05:19,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:19,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285313836] [2019-12-27 16:05:19,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:19,965 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:05:19,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285313836] [2019-12-27 16:05:19,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:19,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:05:19,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [685923990] [2019-12-27 16:05:19,966 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:20,017 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:20,270 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 293 states and 584 transitions. [2019-12-27 16:05:20,270 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:20,398 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 16:05:20,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:05:20,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:20,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:05:20,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:05:20,399 INFO L87 Difference]: Start difference. First operand 19884 states and 60700 transitions. Second operand 10 states. Received shutdown request... [2019-12-27 16:05:20,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 16:05:20,992 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 16:05:20,995 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 16:05:20,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:05:20 BasicIcfg [2019-12-27 16:05:20,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:05:20,997 INFO L168 Benchmark]: Toolchain (without parser) took 194279.18 ms. Allocated memory was 137.4 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 99.7 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 16:05:20,997 INFO L168 Benchmark]: CDTParser took 0.63 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 16:05:20,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 901.72 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.3 MB in the beginning and 154.2 MB in the end (delta: -55.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:05:20,998 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.36 ms. Allocated memory is still 201.3 MB. Free memory was 154.2 MB in the beginning and 151.5 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:05:20,999 INFO L168 Benchmark]: Boogie Preprocessor took 40.13 ms. Allocated memory is still 201.3 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:05:20,999 INFO L168 Benchmark]: RCFGBuilder took 1067.07 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 99.3 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-27 16:05:20,999 INFO L168 Benchmark]: TraceAbstraction took 192202.04 ms. Allocated memory was 201.3 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 98.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 16:05:21,002 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.63 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 901.72 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.3 MB in the beginning and 154.2 MB in the end (delta: -55.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.36 ms. Allocated memory is still 201.3 MB. Free memory was 154.2 MB in the beginning and 151.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.13 ms. Allocated memory is still 201.3 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1067.07 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 99.3 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192202.04 ms. Allocated memory was 201.3 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 98.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 7082 VarBasedMoverChecksPositive, 219 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 89688 CheckedPairsTotal, 119 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (19884states) and FLOYD_HOARE automaton (currently 20 states, 10 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 26 known predicates. - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (19884states) and FLOYD_HOARE automaton (currently 20 states, 10 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 26 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: TIMEOUT, OverallTime: 192.0s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 59.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4192 SDtfs, 4716 SDslu, 8347 SDs, 0 SdLazy, 4323 SolverSat, 209 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 71 SyntacticMatches, 28 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183252occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 106.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 313908 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 626 NumberOfCodeBlocks, 626 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 603 ConstructedInterpolants, 0 QuantifiedInterpolants, 81859 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